![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DFS
文章平均质量分 64
NoooName
这个作者很懒,什么都没留下…
展开
-
[Leetcode]Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1原创 2015-01-17 23:14:52 · 359 阅读 · 0 评论 -
[Leetcode]Subsets
Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For exa原创 2015-01-20 16:52:32 · 355 阅读 · 0 评论 -
[Leetcode]Path Sum II
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 = 22, 5 / \原创 2015-01-18 20:13:10 · 313 阅读 · 0 评论 -
[Leetcode]Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2015-01-17 22:29:23 · 323 阅读 · 0 评论 -
[Leetcode]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 binary tree and sum原创 2015-01-17 19:59:09 · 327 阅读 · 0 评论 -
[Leetcode]Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.根据中序遍历和后序遍历构造二叉树~第一回写的代码如下:class Solution: # @pa原创 2015-01-18 23:18:20 · 314 阅读 · 0 评论 -
[Leetcode]Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th原创 2015-01-19 16:15:35 · 311 阅读 · 0 评论 -
[Leetcode]Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could you devis原创 2015-01-19 15:48:59 · 400 阅读 · 0 评论 -
[Leetcode]Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.跟上一道类似,根据前序遍历和中序遍历重新构造出二叉树~解法也是基本上一样得,代码如下~class Solu原创 2015-01-18 23:30:14 · 306 阅读 · 0 评论 -
[Leetcode]Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.原创 2015-02-08 22:29:10 · 465 阅读 · 0 评论