我如今是一名Android Developer,大学的我曾是一名ACMer,为了不想让算法淡出我的记忆,故重拾LeetCode之Algorithm,语言选择的是Java,题库会一点点完善起来,按简单,中等,困难分类,相应难度下按题号排序,工程代码在project目录中,相关解题都在note目录中,欢迎star。
# | Title | Tag |
---|---|---|
1 | Two Sum | Array, Hash Table |
7 | Reverse Integer | Math |
9 | Palindrome Number | Math |
13 | Roman to Integer | Math, String |
14 | Longest Common Prefix | String |
20 | Valid Parentheses | Stack, String |
21 | Merge Two Sorted Lists | Linked List |
26 | Remove Duplicates from Sorted Array | Array, Two Pointers |
27 | Remove Element | Array, Two Pointers |
28 | Implement strStr() | Two Pointers, String |
35 | Search Insert Position | String |
38 | Count and Say | String |
53 | Maximum Subarray | Array, Dynamic Programming, Divide and Conquer |
58 | Length of Last Word | String |
66 | Plus One | Array, Math |
67 | Add Binary | Math, String |
69 | Sqrt(x) | Binary Search, Math |
70 | Climbing Stairs | Dynamic Programming |
83 | Remove Duplicates from Sorted List | Linked List |
88 | Merge Sorted Array | Array, Two Pointers |
# | Title | Tag |
---|---|---|
2 | Add Two Numbers | Linked List, Math |
8 | String to Integer (atoi) | Math, String |
19 | Remove Nth Node From End of List | Linked List, Two Pointers |
# | Title | Tag |
---|---|---|
4 | Median of Two Sorted Arrays | Binary Search, Array, Divide and Conquer |