|
1 | 1 | ##### 1. [5.Longest Palindrome Substring](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/1.%20longestPalindromeSubstring(Medium)) 查找字符串中最长回文 |
| 2 | + |
2 | 3 | ##### 2. [4.Median of Two Sorted Arrays](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/2.%20findMidianSortedArrays(Hard)) 查找两个已排序数组的中位数 |
| 4 | + |
3 | 5 | ##### 3. [3.Longest Substring Without Repeating](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/3.%20longestSubstringWithoutRepeating(Medium)) 查找字符串中的最长不重复子串的长度 |
| 6 | + |
4 | 7 | ##### 4. [8.String to Integer(atio)](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/4.%20stringToInteger(atio)(Medium)) 手动实现atio函数,转换str到int |
| 8 | + |
5 | 9 | ##### 5. [9.Palindrome Number](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/5.%20palindromeNumber(Easy)) 判断一个整数是否为回文数,不使用额外变量 |
| 10 | + |
6 | 11 | ##### 6. [617.Merge Two Binary Trees](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/6.%20mergeTwoBinaryTree(Easy)) 合并两棵二叉树 |
| 12 | + |
7 | 13 | ##### 7. [10.Regular Expression Matching](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/7.%20regularExpressionMatching(Hard)) 实现.*正则表达式匹配函数 |
| 14 | + |
8 | 15 | ##### 8. [2.Add Two Numbers](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/8.%20addTwoLinkedNumbers(Medium)) 将两个链表整数相加 |
| 16 | + |
9 | 17 | ##### 9. [1.Two Sum](https://github.com/SherlockUnknowEn/leetcode/tree/master/1-9/9.%20twoSum(Easy)) 从数组中寻找和的相加数 |
| 18 | + |
10 | 19 | ##### 10. [7.Reverse Integer](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/10.%20reverseInteger(Easy)) 反转整数 |
| 20 | + |
11 | 21 | ##### 11. [11.Container With Most Water](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/11.%20Container%20With%20Most%20Water(Medium)) 容器最大盛水量问题 |
| 22 | + |
12 | 23 | ##### 12. [12.Integer to Roman](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/12.%20Integer%20to%20Roman(Medium)) 阿拉伯数字转换成罗马数字 |
| 24 | + |
13 | 25 | ##### 13. [13.Roman to Integer](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/13.%20Roman%20to%20integer(Easy)) 罗马数字转换成阿拉伯数字 |
| 26 | + |
14 | 27 | ##### 14. [14.Longest Common Prefix](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/14.%20Longest%20Common%20Prefix(Easy)) 字符串数组最长公共前缀 |
| 28 | + |
15 | 29 | ##### 15. [15.3Sum](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/15.%2015.3Sum(Medium)) 三元组相加获得target |
| 30 | + |
16 | 31 | ##### 16. [16.3Sum Closest](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/16.%203SumClosest(Medium)) 三元组相加获得结果最接近target |
| 32 | + |
17 | 33 | ##### 17. [17.Letter Combinations of a Phone Number](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/17.%20Letter%20Combinations%20of%20a%20Phone%20Number(Medium)) 九宫格数字键盘字符组合 |
| 34 | + |
18 | 35 | ##### 18. [18.4Sum](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/18.%2018.4Sum(Medium)) 四元组相加获得target |
| 36 | + |
19 | 37 | ##### 19. [19.Remove Nth Node From End of List](https://github.com/SherlockUnknowEn/leetcode/tree/master/10-19/19.%20Remove%20Nth%20Node%20From%20End%20of%20List(Medium)) 移除链表倒数第n个元素 |
| 38 | + |
20 | 39 | ##### 20. [20.Valid Parentheses](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/20.%20Valid%20Parentheses(Easy)) 验证大小中括号是否成对闭合匹配 |
| 40 | + |
21 | 41 | ##### 21. [21.Merge Two Sorted Lists](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/21.%20Merge%20Two%20Sorted%20Lists(Easy)) 合并两个已排序的链表 |
| 42 | + |
22 | 43 | ##### 22. [22.Generate Parentheses](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/22.%20Generate%20Parentheses(Medium)) 构造n个成对括号 |
| 44 | + |
23 | 45 | ##### 23. [23.Merge k Sorted Lists](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/23.%20Merge%20k%20Sorted%20Lists(Hard)) 合并n个已排序的链表 |
| 46 | + |
24 | 47 | ##### 24. [24.Swap Nodes in Pairs](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/24.%20Swap%20Nodes%20in%20Pairs(Medium)) 成对交换链表节点 |
| 48 | + |
25 | 49 | ##### 25. [25.Reverse Nodes in k-Group](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/25.%20Reverse%20Nodes%20in%20k-Group(Hard)) k组倒置链表节点 |
| 50 | + |
26 | 51 | ##### 26. [26.Remove Duplicates from Sorted Array](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/26.%20Remove%20Duplicates%20from%20Sorted%20Array(Easy)) 移除数组中重复元素 |
| 52 | + |
27 | 53 | ##### 27. [29.Divide Two Integers](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/27.%20Divide%20Two%20Integers(Hard)) 两数相除——不允许使用高级运算 |
| 54 | + |
28 | 55 | ##### 28. [30.Substring with Concatenation of All Words](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/28.%20Substring%20with%20Concatenation%20of%20All%20Words(Hard)) 寻找所有词串联的子串的位置 |
| 56 | + |
29 | 57 | ##### 29. [31.Next Permutation](https://github.com/SherlockUnknowEn/leetcode/tree/master/20-29/29.%20Next%20Permutation(Medium)) 数字数组的下一个最小排列 |
| 58 | + |
30 | 59 | ##### 30. [32.Longest Valid Parentheses](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/30.%20Longest%20Valid%20Parentheses(Hard)) 求最长的括弧匹配子串的长度 |
| 60 | + |
31 | 61 | ##### 31. [33.Search in Rotated Sorted Array](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/31.%20Search%20in%20Rotated%20Sorted%20Array(Medium)) 反转内数组搜寻元素 |
| 62 | + |
32 | 63 | ##### 32. [Search for a Range](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/32.%20Search%20for%20a%20Range(Medium)) 查找元素在数组中的位置范围 |
| 64 | + |
33 | 65 | ##### 33. [35.Search Insert Position](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/33.%20Search%20Insert%20Position(Easy)) 查找元素插入的位置 |
| 66 | + |
34 | 67 | ##### 34. [36.Valid Sudoku](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/34.%20Valid%20Sudoku(Medium)) 验证数独题目是否合规 |
| 68 | + |
35 | 69 | ##### 35. [37.Sudoku Solver](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/35.%20Sudoku%20Solver(Hard)) 数独解题器 |
| 70 | + |
36 | 71 | ##### 36. [38.Count and Say](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/36.%20Count%20and%20Say(Easy)) 报数 |
| 72 | + |
37 | 73 | ##### 37. [39.Combination Sum](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/37.%20Combination%20Sum(Medium)) 组合总数 |
| 74 | + |
38 | 75 | ##### 38. [40.Combination Sum II](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/38.%20Combination%20Sum%20II(Medium)) 组合总数 II |
| 76 | + |
39 | 77 | ##### 39. [41.First Missing Positive](https://github.com/SherlockUnknowEn/leetcode/tree/master/30-39/39.%20First%20Missing%20Positive(Hard)) 缺失的第一个正数 |
| 78 | + |
40 | 79 | ##### 40. [42.Trapping Rain Water](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/40.%20Trapping%20Rain%20Water(Hard)) 接雨水 |
| 80 | + |
41 | 81 | ##### 41. [43.Multiply Strings](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/41.%20Multiply%20Strings(Medium)) 字符串相乘 |
| 82 | + |
42 | 83 | ##### 42. [45.Jump Game II](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/42.%20Jump%20Game%20II(Hard)) 跳跃游戏II |
| 84 | + |
43 | 85 | ##### 43. [55.Jump Game I](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/43.%20Jump%20Game%20I(Medium)) 跳跃游戏I |
| 86 | + |
44 | 87 | ##### 44. [53.Maximum Subarray](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/44.%20Maximum%20Subarray(Easy)) 最大子序列和 |
| 88 | + |
45 | 89 | ##### 45. [48.Rotate Image](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/45.%20Rotate%20Image(Medium)) 旋转图像 |
| 90 | + |
46 | 91 | ##### 46. [54.Spiral Matrix](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/46.%20Spiral%20Matrix(Medium)) 螺旋矩阵 |
| 92 | + |
47 | 93 | ##### 47. [56.Merge Intervals](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/47.%20Merge%20Intervals(Medium)) 合并区间 |
| 94 | + |
48 | 95 | ##### 48. [57.Insert Intervals](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/48.%20Insert%20Interval(Hard)) 插入区间 |
| 96 | + |
49 | 97 | ##### 49. [59.Spiral Matrix II](https://github.com/SherlockUnknowEn/leetcode/tree/master/40-49/49.%20Spiral%20Matrix%20II(Medium)) 螺旋矩阵II |
| 98 | + |
50 | 99 | ##### 50. [62.Unique Paths](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/50.%20Unique%20Paths(Medium)) 不同路径 |
| 100 | + |
51 | 101 | ##### 51. [63.Unique Paths II](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/51.%20Unique%20Paths%20II(Medium)) 不同路径II |
| 102 | + |
52 | 103 | ##### 52. [64.Minimum Path Sum](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/52.%20Minimum%20Path%20Sum(Medium)) 最短路径和 |
| 104 | + |
53 | 105 | ##### 53. [66.Plus One](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/53.%20Plus%20One(Easy)) 加一 |
| 106 | + |
54 | 107 | ##### 54. [73.Set Matrix Zeroes](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/54.%20Set%20Matrix%20Zeros(Medium)) 矩阵置零 |
| 108 | + |
55 | 109 | ##### 55. [74.Search a 2D Matrix](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/55.%20Search%20a%202D%20Matrix(Medium)) 搜索二维矩阵 |
| 110 | + |
56 | 111 | ##### 56. [75.Sort Colors](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/56.%20Sort%20Colors(Medium)) 颜色排序 |
| 112 | + |
57 | 113 | ##### 57. [78.Subsets](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/57.%20Subsets(Medium)) 子集 |
| 114 | + |
58 | 115 | ##### 58. [79.Word Search](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/58.%20Word%20Search(Medium)) 单词搜索 |
| 116 | + |
59 | 117 | ##### 59. [80.Remove Duplicates from Sorted Array II](https://github.com/SherlockUnknowEn/leetcode/tree/master/50-59/59.%20Remove%20Duplicates%20from%20Sorted%20Array%20II(Medium)) 删除排序数组中的重复项 II |
| 118 | + |
60 | 119 | ##### 60. [141.Linked List Cycle](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/60.%20Linked%20List%20Cycle(Easy)) 环形链表 |
| 120 | + |
61 | 121 | ##### 61. [142.Linked List Cycle II](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/61.%20Linked%20List%20Cycle%20II(Medium)) 环形链表 II |
| 122 | + |
62 | 123 | ##### 62. [160.Intersection of Two Linked Lists](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/62.%20Intersection%20of%20Two%20Linked%20Lists(Easy)) 相交链表 |
| 124 | + |
63 | 125 | ##### 63. [876.Middle of the Linked List](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/63.%20Middle%20of%20the%20Linked%20List(Easy)) 链表的中间结点 |
64 | 126 |
|
65 | 127 | ##### 64. [92.Reverse Linked List II](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/64.%20Reverse%20Linked%20List%20II(Medium)) 反转链表 II |
|
68 | 130 |
|
69 | 131 | ##### 66. [86.Partition List](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/66.%20Partition%20List(Medium)) 分隔链表 |
70 | 132 |
|
71 | | -##### 67. [138.Copy List with Random Pointer](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/67.%20Copy%20List%20with%20Random%20Pointer(Medium)) 复制带随机指针的链表 |
| 133 | +##### 67. [138.Copy List with Random Pointer](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/67.%20Copy%20List%20with%20Random%20Pointer(Medium)) 复制带随机指针的链表 |
| 134 | + |
| 135 | + |
| 136 | + |
| 137 | + |
| 138 | + |
| 139 | + |
| 140 | + |
| 141 | +[leetcode/未整理的题集](https://github.com/SherlockUnknowEn/leetcode/tree/master/%E6%9C%AA%E6%95%B4%E7%90%86) 未整理的题集,仅有代码 |
0 commit comments