-
学生, 坐标都柏林, 刷题快乐
-
GitHub： ZZhang
-
语言: Java
-
五步刷题法:
- 第一遍
- 5 min 读题 + 思考 (最多10到15分钟)
- 直接看解法, 多解法,比较优劣
- 背诵默写好的解法.
- 第二遍
- 马上自己写. Leetcode提交,直到通过.
- 多种解法比较,体会 -----> 优化
- 第三遍
- 第二天重新做这道题目
- 对不熟练的揭发,做专项练习
- 第四遍
- 7天后重做题目
- 第五遍
- 面试前一星期重做题目
- 第一遍
| Problem | No.1 | No.2 | No.3 | No.4 |
|---|---|---|---|---|
| 1.Two Sum | 20/0507 | 20/0508 | 20/0517 | |
| 11.Container With Most Water | 20/0507 | 20/0508 | 20/0517 | |
| 15.3 SUM | 20/0508 | 20/0516 | 20/0524 | |
| 24.Swap Nodes In Pairs | 20/0508 | 20/0516 | 20/0524 | |
| 25.Reverse Nodes in k-Group | 20/0518 | 20/0519 | 20/0528 | |
| 26.Remove Duplicates from Sorted Array | 20/0518 | 20/0519 | 20/0528 | |
| 70.Climbing Stais | 20/0507 | 20/0508 | 20/0517 | |
| 141.Linked List Cycle | 20/0508 | 20/0516 | 20/0524 | |
| 142.Linked List Cycle II | 20/0508 | 20/0516 | 20/0524 | |
| 189.Rotate Array | 20/0518 | 20/0519 | 20/0528 | |
| 206.Reverse Linked List | 20/0508 | 20/0516 | 20/0524 | |
| 21.Merge Two Sorted Lists | 20/0519 | 20/0520 | 20/0708 | |
| 88.Merge Sorted Array | 20/0519 | 20/0520 | 20/0708 | |
| 66.Plus One | 20/0519 | 20/0520 | 20/0710 | |
| 155.Min Stack | 20/0520 | 20/0521 | 20/0711 | |
| 20.Valid Parentheses | 20/0520 | 20/0521 | 20/0712 | |
| 239.Sliding Window Maximum | 20/0521 | 20/0522 | 20/07/17 | |
| 84.Largest Rectangle in Histogram | 20/0521 | 20/0522 | 20/0720 | |
| 2.Add Two Numbers | 20/0522 | 20/0523 | 20/0726 | |
| 42.Trapping Rain Water | 20/0524 | 20/0525 | 20/0720 | |
| 242.Valid Anagram | 20/0721 | 20/0722 | 20/07/31 | |
| 49.Group Anagrams | 20/0721 | 20/0722 | 20/08/02 | |
| 94.Binary Tree Inorder Traversal | 20/0722 | 20/0723 | 20/08/02 | |
| 144.Binary Tree Preorder Traversal | 20/0723 | 20/0724 | 20/08/05 | |
| 590.N-ary Tree Postorder Traversal | 20/0723 | 20/0724 | 20/08/05 | |
| 589.N-ary Tree Preorder Traversal | 20/0723 | 20/0724 | 20/08/05 | |
| 429.N-ary Tree Level Order Traversal | 20/0723 | 20/0724 | 20/08/05 | |
| 22.Generate Parentheses | 20/0724 | 20/0725 | 20/08/05 | |
| 226.Invert Binary Tree | 20/0725 | 20/0726 | 20/08/05 | |
| 98.Validate Binary Search Tree | 20/0725 | 20/0726 | 20/08/05 | |
| 111.Minimum Depth of Binary Tree | 20/0726 | 20/08/05 | 20/09/04 | |
| 104.Maximum Depth of Binary Tree | 20/0726 | 20/08/05 | 20/09/04 | |
| 297.Serialize and Deserialize Binary Tree | 20/0726 | 20/08/05 | 20/09/04 | |
| 235.Lowest Common Ancestor of a Binary Search Tree | 20/0806 | 20/0807 | 20/09/04 | |
| 105.Construct Binary Tree from Preorder and Inorder Traversal | 20/0806 | 20/0807 | 20/09/04 | |
| 236.Lowest Common Ancestor of a Binary Tree | 20/0806 | 20/0807 | 20/09/04 | |
| 50.Pow(x, n) | 20/0807 | 20/0808 | 20/09/04 | |
| 78.Subsets | 20/0807 | 20/0808 | 20/09/04 | |
| 169.Majority Element | 20/0809 | 20/0810 | 20/09/04 | |
| 17.Letter Combinations of a Phone Number | 20/0809 | 20/0810 | 20/09/05 | |
| 51.N Queue | 20/0810 | 20/09/05 | ||
| 77.Combinations | 20/09/06 | 20/09/07 | 20/09/19 | |
| 46.Permutations | 20/09/07 | 20/09/08 | 20/09/19 | |
| 47.Permutations II | 20/09/07 | 20/09/08 | 20/09/19 | |
| 102.Binary Tree Level Order Traversal | 20/09/08 | 20/09/09 | ||
| 433.Minimum Genetic Mutation | 20/09/09 | 20/09/10 | ||
| 515.Find Largest Value in Each Tree Row | 20/09/09 | 20/09/10 |