官方手册:下载

Chapter 1: Array/String(1-16)

1. Two Sum(1. 两数之和)https://blog.csdn.net/pkgray/article/details/80840512
2. Two Sum II – Input array is sorted(167. 两数之和 II - 输入有序数组)https://blog.csdn.net/pkgray/article/details/80840589
3. Two Sum III – Data structure design(170 Two Sum III - Data structure design)https://blog.csdn.net/pkgray/article/details/81182515
4. Valid Palindrome(125. 验证回文串)https://blog.csdn.net/pkgray/article/details/80841226
5. Implement strstr()(28. 实现strStr())https://blog.csdn.net/pkgray/article/details/80841559
6. Reverse Words in a String(151. 翻转字符串里的单词)https://blog.csdn.net/pkgray/article/details/80842991
7. Reverse Words in a String II(186 Reverse Words in a String II)https://blog.csdn.net/pkgray/article/details/81197473
8. String to Integer (atoi)
9. Valid Number
10. Longest Substring Without Repeating Characters
11. Longest Substring with At Most Two Distinct Characters
12. Missing Ranges(163. Missing Ranges)https://blog.csdn.net/pkgray/article/details/81150768
13. Longest Palindromic Substring
14. One Edit Distance
15. Read N Characters Given Read4
16. Read N Characters Given Read4 – Call multiple times

Chapter 2: Math(17-19)

17. Reverse Integer(7. 反转整数)https://blog.csdn.net/pkgray/article/details/80877638
18. Plus One(66. 加一)https://blog.csdn.net/pkgray/article/details/80881115
19. Palindrome Number(9. 回文数)https://blog.csdn.net/pkgray/article/details/80881808

Chapter 3: Linked List(20-24)

20. Merge Two Sorted Lists
21. Add Two Numbers
22. Swap Nodes in Pairs
23. Merge K Sorted Linked Lists
24. Copy List with Random Pointer

Chapter 4: Binary Tree(25-32)

25. Validate Binary Search Tree
26. Maximum Depth of Binary Tree
27. Minimum Depth of Binary Tree
28. Balanced Binary Tree
29. Convert Sorted Array to Balanced Binary Search Tree
30. Convert Sorted List to Balanced Binary Search Tree
31. Binary Tree Maximum Path Sum
32. Binary Tree Upside Down

Chapter 5: Bit Manipulation(33-34)

33. Single Number(136. 只出现一次的数字)https://blog.csdn.net/pkgray/article/details/80871664

34. Single Number II(137. 只出现一次的数字 II)https://blog.csdn.net/pkgray/article/details/80871665

Chapter 6: Misc(35-38)

35. Spiral Matrix
36. Integer to Roman
37. Roman to Integer
38. Clone graph

Chapter 7: Stack(39-41)

39. Min Stack(155. 最小栈)https://blog.csdn.net/pkgray/article/details/80853881
40. Evaluate Reverse Polish Notation(150. 逆波兰表达式求值)https://blog.csdn.net/pkgray/article/details/80862610
41. Valid Parentheses(20. 有效的括号)https://blog.csdn.net/pkgray/article/details/80863030

Chapter 8: Dynamic Programming(42-47)

42. Climbing Stairs(70. 爬楼梯)https://blog.csdn.net/pkgray/article/details/80860029
43. Unique Paths
44. Unique Paths II
45. Maximum Sum Subarray
46. Maximum Product Subarray
47. Coins in a Line

Chapter 9: Binary Search(48-50)

48. Search Insert Position(35. 搜索插入位置)https://blog.csdn.net/pkgray/article/details/80858183
49. Find Minimum in Sorted Rotated Array(153. 寻找旋转排序数组中的最小值)https://blog.csdn.net/pkgray/article/details/80854648
50. Find Minimum in Rotated Sorted Array II – with duplicates(154. 寻找旋转排序数组中的最小值 II)https://blog.csdn.net/pkgray/article/details/80857856