LeetCode
文章平均质量分 82
kyoto_hu
这个作者很懒,什么都没留下…
展开
-
Max Points on a Line(LeetCode)
dafsdfas原创 2014-07-18 17:39:00 · 353 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II (LeetCode)
题目:ti原创 2014-08-02 20:23:02 · 521 阅读 · 0 评论 -
Pascal's Triangle(LeetCode)
题目:题目分析:思路原创 2014-08-02 15:37:46 · 411 阅读 · 0 评论 -
Candy(LeetCode)
题目:原创 2014-07-28 17:08:07 · 390 阅读 · 0 评论 -
Binary Tree Inorder Traversal(LeetCode)
题目:思路:zhui'yi'di'a原创 2014-08-05 13:56:15 · 329 阅读 · 0 评论 -
Clone Graph(LeetCode)
题目:Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separat原创 2014-07-31 13:15:50 · 478 阅读 · 0 评论 -
Valid Palindrome(LeetCode)
题目:思路:注意点:代码:原创 2014-07-31 18:56:22 · 327 阅读 · 0 评论 -
Sum Root to Leaf Numbers(LeetCode)
题目:思路:原创 2014-07-31 17:36:36 · 334 阅读 · 0 评论 -
Longest Consecutive Sequence(LeetCode)
题目:思路:注意点:代码:原创 2014-07-31 18:18:33 · 308 阅读 · 0 评论 -
Reverse Linked List II (LeetCode)
题目:题目分析:思路:注意点:代码:原创 2014-08-07 12:34:31 · 451 阅读 · 0 评论 -
Pascal's Triangle II(LeetCode)
题目:题目分析:思路:注意点:代码:原创 2014-08-02 16:35:50 · 336 阅读 · 0 评论 -
Path Sum II(LeetCode)
题目:题目分析:思路:注意点:原创 2014-08-03 10:26:57 · 405 阅读 · 0 评论 -
Triangle(LeetCode)
题目:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3原创 2014-08-01 21:17:39 · 413 阅读 · 0 评论 -
Path Sum(LeetCode)
题目:题目分析:思路:原创 2014-08-03 09:13:46 · 338 阅读 · 0 评论 -
Copy List with Random Pointer (LeetCode)
题目:思路:原创 2014-07-27 11:22:13 · 395 阅读 · 0 评论 -
Evaluate Reverse Polish Notation(LeetCode)
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+",原创 2014-07-21 15:36:00 · 389 阅读 · 0 评论 -
Sort List(LeetCode)
题目:思路:注意点:代码:原创 2014-07-23 15:56:17 · 486 阅读 · 0 评论 -
Insertion Sort List (LeetCode)
题目:思路:注意点:代码:原创 2014-07-23 23:27:42 · 556 阅读 · 0 评论 -
Binary Tree Postorder Traversal (LeetCode)
题目:代码:原创 2014-07-25 18:07:59 · 307 阅读 · 0 评论 -
LRU Cache(LeetCode)
题目:思路:zh原创 2014-07-25 17:13:01 · 548 阅读 · 0 评论 -
Reorder List(LeetCode)
题目:原创 2014-07-26 07:52:31 · 318 阅读 · 0 评论 -
Linked List Cycle II(LeetCode)
题目:思路:dai'ma原创 2014-07-26 10:42:31 · 325 阅读 · 0 评论 -
Binary Tree Maximum Path Sum(LeetCode)
题目:难度级别: ★★★原创 2014-08-01 20:31:53 · 314 阅读 · 0 评论 -
Best Time to Buy and Sell Stock II (LeetCode)
题目:思路:原创 2014-08-02 00:13:11 · 603 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node (LeetCode)
题目:原创 2014-08-02 19:47:35 · 429 阅读 · 0 评论 -
Best Time to Buy and Sell Stock(LeetCode)
题目:题目分析:注意点:原创 2014-08-01 23:26:20 · 486 阅读 · 0 评论 -
Minimum Depth of Binary Tree(LeetCode)
题目:题目分析:思路:代码:原创 2014-08-03 11:05:48 · 366 阅读 · 0 评论