帮助文档存放在Help文件夹下。
| 文件名 | 文件描述 | 链接 |
|---|---|---|
| complexitypython.txt | Python的一些常规操作的复杂度统计 | URL |
| ID | Difficulty | Title | Java | Python |
|---|---|---|---|---|
| 1 | Easy | 两数之和 | Java | Python |
| 26 | Easy | 删除排序数组中的重复项 | Java | Python |
| 27 | Easy | 移除元素 | Java | |
| 35 | Easy | 搜索插入位置 | Java | |
| ID | Difficulty | Title | Java | Python |
|---|---|---|---|---|
| 21 | Easy | Merge Two Sorted Lists | Python | |
| 83 | Easy | Remove Duplicates from Sorted List | Python | |
| 141 | Easy | Linked List Cycle | Python | |
| 160 | Easy | Intersection of Two Linked Lists | Python | |
| 203 | Easy | Remove Linked List Elements | no | |
| 206 | Easy | Reverse Linked List | Python | |
| 234 | Easy | Palindrome Linked List | Python | |
| 237 | Easy | Delete Node in a Linked List | Python | |
| 2 | Medium | Add Two Numbers | Python | |
| 61 | Medium | Rotate | Python |
| ID | Difficulty | Title | Java | C++ |
|---|---|---|---|---|
| 20 | Easy | Valid Parentheses | C++ | |
| 155 | Easy | Min Stack | C++ | |
| 255 | Easy | Implement Stack using Queues | C++ | |
| 232 | Easy | Implement Queue using Stacks | C++ | |
| 496 | Easy | Next Greater Element I | C++ | |
| 150 | Medium | Evaluate Reverse Polish Notation | C++ |
| ID | Difficulty | Title | Java | Python |
|---|---|---|---|---|
| 13 | Easy | Roman to Integer | Python | |
| 14 | Easy | Longest Common Prefix | Python | |
| 28 | Easy | Implement strStr | Python | |
| 38 | Easy | Count and Say | Python | |
| 125 | Easy | Valid Palindrome | Python | |
| 150 | Easy | Add Binary | Python | |
| 344 | Easy | Reverse String | Python | |
| 345 | Easy | Reverse Vowels of a String | Python | |
| 383 | Easy | Ransom Note | Python | |
| 434 | Easy | Number of Segments in a String | Python | |
| 520 | Easy | Detect Capital | Python | |
| 521 | Easy | Longest Uncommon Subsequence I | Python | |
| 541 | Easy | Reverse String II | Python | |
| 551 | Easy | Student Attendance Record I | Python | |
| 557 | Easy | Reverse Words in a String III | Python | |
| 657 | Easy | Judge Route Circle | Python | |
| 3 | Medium | Longest Substring Without Repeating Characters | Python | |
| 5 | Medium | Longest Palindromic Substring | Python | |
| 17 | Medium | Letter Combinations of a Phone Number | Python | |
| 22 | Medium | Generate Parentheses | Python | |
| 43 | Medium | Multiply Strings | Python | |
| 609 | Medium | Find Duplicate File in System | Python |
| ID | Difficulty | Title | Java | Python |
|---|---|---|---|---|
| 111 | Easy | Minimum Depth of Binary Tree | Py-1 Py-2 | |
| 112 | Easy | Path Sum | Py-1 Py-2 | |
| 235 | Easy | Lowest Common Ancestor of a Binary Search Tree | Py-1 Py-2 | |
| 501 | Easy | Find Mode in Binary Search Tree | Python | |
| 543 | Easy | Diameter of Binary Tree | Python | |
| 606 | Easy | Construct String from Binary Tree | Python | |
| 113 | Medium | Path Sum II | Python |
| ID | Difficulty | Title | Java | Python |
|---|---|---|---|---|
| 290 | Easy | Word Pattern.mde | Python |