LeetCode - 随笔分类(第3页) - vincently

[LeetCode] Convert Sorted Array to Binary Search Tree

摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.思路：递归的思路。思路与重建二叉树类似。时间复杂度O(n), 空间复杂度O(logN) 1 /** 2 ... 阅读全文

posted @ 2015-01-20 20:14 vincently 阅读(220) 评论(0) 推荐(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 n... 阅读全文

posted @ 2015-01-20 11:44 vincently 阅读(296) 评论(0) 推荐(0)

[leetCode] 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-01-18 22:40 vincently 阅读(232) 评论(0) 推荐(0)

[LeetCode] 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-01-18 22:12 vincently 阅读(179) 评论(0) 推荐(0)

[LeetCode] [LeetCode] Populating Next Right Pointers in Each Node II

摘要：Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文

posted @ 2015-01-18 16:51 vincently 阅读(188) 评论(0) 推荐(0)

[LeetCode] Populating Next Right Pointers in Each Node

摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文

posted @ 2015-01-18 13:59 vincently 阅读(149) 评论(0) 推荐(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 ... 阅读全文

posted @ 2015-01-18 12:50 vincently 阅读(227) 评论(0) 推荐(0)

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

posted @ 2015-01-17 21:08 vincently 阅读(328) 评论(0) 推荐(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. 1 /** 2 * De... 阅读全文

posted @ 2015-01-17 19:25 vincently 阅读(225) 评论(0) 推荐(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. 1 /** 2 * Def... 阅读全文

posted @ 2015-01-17 15:47 vincently 阅读(192) 评论(0) 推荐(0)

[LeetCode] 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-01-17 13:10 vincently 阅读(283) 评论(0) 推荐(0)

[LeetCode] Binary Tree Level Order Traversal II

摘要：iven 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 exam... 阅读全文

posted @ 2015-01-16 21:09 vincently 阅读(233) 评论(0) 推荐(0)

[LeetCode] 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-01-16 20:38 vincently 阅读(316) 评论(0) 推荐(0)

[LeetCode] Binary Tree Inorder Traversal

摘要：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文

posted @ 2015-01-16 19:59 vincently 阅读(306) 评论(0) 推荐(0)

[LeetCode] Binary Tree Postorder Traversal

摘要：Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文

posted @ 2015-01-16 19:53 vincently 阅读(246) 评论(0) 推荐(0)

[LeetCode] Binary Tree Preorder Traversal

摘要：Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not... 阅读全文

posted @ 2015-01-16 19:46 vincently 阅读(311) 评论(0) 推荐(0)

[LeetCode] Maximum Subarray

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

posted @ 2014-12-01 17:11 vincently 阅读(233) 评论(0) 推荐(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 andsum =... 阅读全文

posted @ 2014-11-29 11:45 vincently 阅读(203) 评论(0) 推荐(0)

[LeetCode] PathSum

摘要：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.Fo... 阅读全文

posted @ 2014-11-29 10:53 vincently 阅读(182) 评论(0) 推荐(0)

[LeetCode] Merge Two Sorted Lists

摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.注意写出鲁棒性的代... 阅读全文

posted @ 2014-11-27 22:09 vincently 阅读(122) 评论(0) 推荐(0)

随笔分类 - LeetCode

公告