- 博客(6)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode : Partition List
Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of
2015-03-31 09:29:09
576
原创 LeetCode:Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the t
2015-03-29 08:58:14
951
原创 Binary Tree Maximum Path Sum
LeetCode ：Binary Tree Maximum Path SumGiven 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,
2015-03-27 15:21:35
890
原创 LeetCode Min Stack
LeetCode Min StackDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of
2015-03-21 10:33:28
700
原创 LeetCode Repeated DNA Sequences
LeetCode Repeated DNA SequencesAll DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repe
2015-03-10 19:45:55
745
原创 LeetCode Rotate Array
LeetCode Rotate ArrayRotate Array Total Accepted: 5488 Total Submissions: 29811 My Submissions Question Solution Rotate an array of n elements to the right by k steps.For example, with n = 7
2015-03-03 15:16:48
1527
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人