| | | | |

2016年10月29日

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文

posted @ 2016-10-29 17:54 xiaoba1203 阅读(253) 评论(0) 推荐(0) 编辑

leetcode 112 Path Sum ----- java

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文

posted @ 2016-10-29 17:31 xiaoba1203 阅读(143) 评论(0) 推荐(0) 编辑

leetcode 111 Minimum Depth of Binary Tree ----- java

摘要： Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文

posted @ 2016-10-29 16:49 xiaoba1203 阅读(143) 评论(0) 推荐(0) 编辑

leetcode 110 Balanced Binary Tree ----- java

摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文

posted @ 2016-10-29 16:39 xiaoba1203 阅读(141) 评论(0) 推荐(0) 编辑

leetcode 109 Convert Sorted List to Binary Search Tree ----- java

摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 和上一题类似，把数组换成链表，所以可以两种做法： 1、把链表换成数组，然后用上一阅读全文

posted @ 2016-10-29 16:18 xiaoba1203 阅读(163) 评论(0) 推荐(0) 编辑

2016年10月29日

公告