LeetCode二叉树问题递归
文章平均质量分 67
大疯疯
这个作者很懒,什么都没留下…
展开
-
LeetCode 404. Sum of Left Leaves 递归终止条件
404. Sum of Left Leaves Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree,原创 2017-05-31 21:46:57 · 275 阅读 · 0 评论 -
LeetCode 112. Path Sum 注意递归的终止条件
112. Path Sum 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. For example: Given the below b原创 2017-05-31 21:21:09 · 478 阅读 · 0 评论 -
LeetCode 279. Perfect Squares 转换思维图的无权BFS,寻最短路径
Perfect Squares题意注意思路代码题外memset的使用279. Perfect Squares Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n. For example:原创 2017-05-26 17:15:34 · 818 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree和111. Minimum Depth of Binary Tree 递归
104. Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.原创 2017-05-27 19:34:51 · 482 阅读 · 0 评论 -
LeetCode 102. Binary Tree Level Order Traversal 树的广度优先遍历 辅助数据结构队列
Binary Tree Level Order Traversal题意思路代码结果102. Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level原创 2017-05-25 22:15:36 · 668 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal 树的前序、中序,后序遍历的非递归实现
题目Binary Tree Inorder TraversalBinary Tree Preorder TraversalBinary Tree Postorder Traversal思路代码题目94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes原创 2017-05-24 20:05:01 · 308 阅读 · 0 评论 -
LeetCode 257. Binary Tree Paths 递归过程保存信息
257. Binary Tree Paths Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are:原创 2017-06-01 21:24:43 · 382 阅读 · 0 评论 -
LeetCode 437. Path Sum III 递归中使用递归,分两类情况
437. Path Sum III You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the原创 2017-06-02 22:00:40 · 550 阅读 · 0 评论 -
LeetCode 235. Lowest Common Ancestor of a Binary Search Tree 二叉搜索树
235. Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on W原创 2017-06-02 22:11:21 · 335 阅读 · 0 评论