~每天进步一点点~

2015年7月21日

[leedcode 107] Binary Tree Level Order Traversal II

摘要： Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文

posted @ 2015-07-21 22:41 ~每天进步一点点~ 阅读(117) 评论(0) 推荐(0) 编辑

[leedcode 106] 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./** * Definiti... 阅读全文

posted @ 2015-07-21 21:39 ~每天进步一点点~ 阅读(129) 评论(0) 推荐(0) 编辑

[leedcode 105] 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./** * Definitio... 阅读全文

posted @ 2015-07-21 21:12 ~每天进步一点点~ 阅读(179) 评论(0) 推荐(0) 编辑

[leedcode 152] Maximum Product Subarray

摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文

posted @ 2015-07-21 18:34 ~每天进步一点点~ 阅读(76) 评论(0) 推荐(0) 编辑

2015年7月20日

[leedcode 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 le... 阅读全文

posted @ 2015-07-20 21:55 ~每天进步一点点~ 阅读(104) 评论(0) 推荐(0) 编辑

[leedcode 103] Binary Tree Zigzag Level Order Traversal

摘要： Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文

posted @ 2015-07-20 21:50 ~每天进步一点点~ 阅读(143) 评论(0) 推荐(0) 编辑

[leedcode 102] Binary Tree Level Order Traversal

摘要： Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文

posted @ 2015-07-20 21:18 ~每天进步一点点~ 阅读(140) 评论(0) 推荐(0) 编辑

[leedcode 101] Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文

posted @ 2015-07-20 16:59 ~每天进步一点点~ 阅读(115) 评论(0) 推荐(0) 编辑

2015年7月16日

[leedcode 100] Same Tree

摘要： Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文

posted @ 2015-07-16 23:08 ~每天进步一点点~ 阅读(113) 评论(0) 推荐(0) 编辑

[leedcode 99] 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 ... 阅读全文

posted @ 2015-07-16 23:03 ~每天进步一点点~ 阅读(192) 评论(0) 推荐(0) 编辑

公告