- 博客(11)
- 收藏
- 关注
RSS订阅原创 8 mins - 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 still work?Note:You may only use constant
2014-05-03 09:29:44
280
原创 1分钟 - Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list.
2014-05-03 04:27:00
372
原创 30 分钟 - Construct Binary Tree from Inorder and Postorder Traversal
递归的出入口没有做好折腾了半天。
2014-05-03 01:07:30
410
原创 不知道写了多久。TestCase自己有问题：Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited number
2014-05-02 17:13:55
480
原创 Haha. 5 min.
Valid Parentheses Total Accepted: 10193 Total Submissions: 36812My SubmissionsGiven a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input stri
2014-05-02 15:19:04
334
原创 15 minutes - Binary Tree Zigzag level order traversal
Binary Tree Zigzag Level Order Traversal Total Accepted: 8216 Total Submissions: 31341My SubmissionsGiven a binary tree, return the zigzag level order traversal of its nodes' values. (ie
2014-05-02 15:09:22
347
原创 6分钟 Longest Common Prefix
Longest Common PrefixcmnIdx的处理有些问题，3分钟写完，3分钟调试，一共6分钟。
2014-05-01 00:42:43
432
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人