Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/jack-cherish/leetcode
:monkey:LeetCode、剑指Offer刷题笔记（C/C++、Python3实现）
https://github.com/jack-cherish/leetcode
algorithms c leetcode python python3
Last synced: 18 days ago
JSON representation
:monkey:LeetCode、剑指Offer刷题笔记（C/C++、Python3实现）
- Host: GitHub
- URL: https://github.com/jack-cherish/leetcode
- Owner: Jack-Cherish
- Created: 2017-03-25T07:47:06.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2020-11-22T04:52:44.000Z (almost 4 years ago)
- Last Synced: 2023-11-07T13:21:01.363Z (12 months ago)
- Topics: algorithms, c, leetcode, python, python3
- Language: C++
- Homepage: https://cuijiahua.com/blog/learing-algorithm/basis/
- Size: 168 KB
- Stars: 2,387
- Watchers: 60
- Forks: 562
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode
原创文章每周最少两篇，**后续最新文章**会在[【公众号】](https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg)首发，视频[【B站】](https://space.bilibili.com/331507846)首发，大家可以加我[【微信】](https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg)进**交流群**，技术交流或提意见都可以，欢迎**Star**！
## 帮助文档
帮助文档存放在Help文件夹下。
| 文件名 | 文件描述 | 链接 |
| :---------: | :----------: | :------------------------------: |
|complexitypython.txt|Python的一些常规操作的复杂度统计|[URL](https://github.com/Jack-Cherish/LeetCode/blob/master/Help/complexitypython.txt "悬停显示")|
## 题目清单
题目清单根据题目类型、难度进行排序，符号`*`代表与上下表格合并。
### Array(数组)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 1 | Easy | Two Sum | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Easy/1.Two%20Sum.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Easy/1.Two%20Sum.md "悬停显示") |
| 11 | Medium | Container With Most Water | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md "悬停显示") | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md "悬停显示") |
### Linked List(链表)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 21 | Easy | Merge Two Sorted Lists | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/21.Merge%20Two%20Sorted%20Lists/Merge%20Two%20Sorted%20Lists.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/21.Merge%20Two%20Sorted%20Lists/Merge%20Two%20Sorted%20Lists.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/65449271 "悬停显示") |
| 83 | * | Remove Duplicates from Sorted List | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/83.Remove%20Duplicates%20from%20Sorted%20List/Remove%20Duplicates%20from%20Sorted%20List.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/83.Remove%20Duplicates%20from%20Sorted%20List/Remove%20Duplicates%20from%20Sorted%20List.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/55106317 "悬停显示") |
| 141 | * | Linked List Cycle | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/141.Linked%20List%20Cycle/Linked%20List%20Cycle.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/141.Linked%20List%20Cycle/Linked%20List%20Cycle.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/55054315 "悬停显示") |
| 160 | * | Intersection of Two Linked Lists | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/160.Intersection%20of%20Two%20Linked%20Lists/Intersection%20of%20Two%20Linked%20Lists.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/160.Intersection%20of%20Two%20Linked%20Lists/Intersection%20of%20Two%20Linked%20Lists.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/56036016 "悬停显示") |
| 203 | * | Remove Linked List Elements | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/203.Remove%20Linked%20List%20Elements/Remove%20Linked%20List%20Elements.cpp "悬停显示") | no |
| 206 | * | Reverse Linked List | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List.py "悬停显示") | [C-迭代](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List-iteratively.c "悬停显示") [C-递归](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List-recursively.c "悬停显示")| [博客思路讲解](http://blog.csdn.net/c406495762/article/details/60884576 "悬停显示") |
| 234 | * | Palindrome Linked List | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/234.Palindrome%20Linked%20List/Palindrome.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/234.Palindrome%20Linked%20List/Palindrome%20Linked%20List.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/64443419 "悬停显示") |
| 237 | Easy | Delete Node in a Linked List | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/237.Delete%20Node%20in%20a%20Linked%20List/Delete%20Node%20in%20a%20Linked%20List.py "悬停显示") | [C](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/237.Delete%20Node%20in%20a%20Linked%20List/Delete%20Node%20in%20a%20Linked%20List.c "悬停显示") | no |
| 2 | Medium | Add Two Numbers | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md "悬停显示") | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md "悬停显示") |
| 61 | Medium | Rotate | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/61.Rotate%20List/Rotate%20List.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/61.Rotate%20List/Rotate%20List.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/65626314 "悬停显示") |
### Stack(栈)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 20 | Easy | Valid Parentheses | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/20.Valid%20Parentheses/Valid%20Parentheses.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/70154279 "悬停显示") |
| 155 | * | Min Stack | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/155.Min%20Stack/Min%20Stack.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/69372722 "悬停显示") |
| 255 | * | Implement Stack using Queues | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/225.Implement%20Stack%20using%20Queues/Implement%20Stack%20using%20Queues.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/67656851 "悬停显示") |
| 232 | * | Implement Queue using Stacks | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/232.Implement%20Queue%20using%20Stacks/Implement%20Queue%20using%20Stacks.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/70149075 "悬停显示") |
| 496 | Easy | Next Greater Element I | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/496.Next%20Greater%20Element%20I/Next%20Greater%20Element%20I.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/69359406 "悬停显示") |
| 150 | Medium | Evaluate Reverse Polish Notation | no | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Medium/150.Evaluate%20Reverse%20Polish%20Notation/Evaluate%20Reverse%20Polish%20Notation.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/70233695 "悬停显示") |
### String(字符串)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 13 | Easy | Roman to Integer | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/13.Roman%20to%20Integer/Roman%20to%20Integer.py "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/13.Roman%20to%20Integer "悬停显示") |
| 14 | * | Longest Common Prefix | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/14.Longest%20Common%20Prefix/Longest%20Common%20Prefix.py "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/14.Longest%20Common%20Prefix "悬停显示") |
| 28 | * | Implement strStr | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/28.Implement%20strStr.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/28.Implement%20strStr.md "悬停显示") |
| 38 | * | Count and Say | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/38.Count%20and%20Say/Count%20and%20Say.py "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/38.Count%20and%20Say "悬停显示") |
| 125 | * | Valid Palindrome | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/125.Valid%20Palindrome.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/125.Valid%20Palindrome.md "悬停显示") |
| 150 | * | Add Binary | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/67.Add%20Binary/Add%20Binary.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/67.Add%20Binary/67.Add%20Binary.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/72519117 "悬停显示") |
| 344 | * | Reverse String | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/344.Reverse%20String/Reverse%20String.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/344.Reverse%20String/Reverse%20String.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/70833096 "悬停显示") |
| 345 | * | Reverse Vowels of a String | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/345.Reverse%20Vowels%20of%20a%20String.md "悬停显示") | no | [博客思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/345.Reverse%20Vowels%20of%20a%20String.md "悬停显示") |
| 383 | * | Ransom Note | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/383.Ransom%20Note.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/383.Ransom%20Note.md "悬停显示") |
| 434 | * | Number of Segments in a String | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/434.Number%20of%20Segments%20in%20a%20String/Number%20of%20Segments%20in%20a%20String.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/434.Number%20of%20Segments%20in%20a%20String/Number%20of%20Segments%20in%20a%20String.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/71786453 "悬停显示") |
| 520 | * | Detect Capital | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/520.Detect%20Capital/Detect%20Capital.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/520.Detect%20Capital/Detect%20Capital.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/73495803 "悬停显示") |
| 521 | * | Longest Uncommon Subsequence I | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/521.Longest%20Uncommon%20Subsequence%20I/Longest%20Uncommon%20Subsequence%20I.py "悬停显示") | no | no |
| 541 | * | Reverse String II | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/541.Reverse%20String%20II/Reverse%20String%20II.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/541.Reverse%20String%20II/Reverse%20String%20II.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/70884683 "悬停显示") |
| 551 | * | Student Attendance Record I | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/551.%20Student%20Attendance%20Record%20I/Student%20Attendance%20Record%20I.py "悬停显示") | no | no |
| 557 | * | Reverse Words in a String III | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/557.Reverse%20Words%20in%20a%20String%20III/Reverse%20Words%20in%20a%20String%20III.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/557.Reverse%20Words%20in%20a%20String%20III/Reverse%20Words%20in%20a%20String%20III.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/73457057 "悬停显示") |
| 657 | Easy | Judge Route Circle | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/657.Judge%20Route%20Circle/Judge%20Route%20Circle.py "悬停显示") | no | no |
| 3 | Medium | Longest Substring Without Repeating Characters | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/3.Longest%20Substring%20Without%20Repeating%20Characters.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/3.Longest%20Substring%20Without%20Repeating%20Characters.md "悬停显示") |
| 5 | * | Longest Palindromic Substring | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/5.Longest%20Palindromic%20Substring.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/5.Longest%20Palindromic%20Substring.md "悬停显示") |
| 17 | * | Letter Combinations of a Phone Number | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/17.Letter%20Combinations%20of%20a%20Phone%20Number.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/17.Letter%20Combinations%20of%20a%20Phone%20Number.md "悬停显示") |
| 22 | * | Generate Parentheses | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/22.Generate%20Parentheses.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/22.Generate%20Parentheses.md "悬停显示") |
| 43 | * | Multiply Strings | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/43.Multiply%20Strings.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/43.Multiply%20Strings.md "悬停显示") |
| 609 | Medium | Find Duplicate File in System | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/609.Find%20Duplicate%20File%20in%20System.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/609.Find%20Duplicate%20File%20in%20System.md "悬停显示") |
### Tree(树)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 111 | Easy | Minimum Depth of Binary Tree | [Py-1](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree-1.py "悬停显示") [Py-2](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree-2.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/75043140 "悬停显示") |
| 112 | * | Path Sum | [Py-1](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum-1.py "悬停显示") [Py-2](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum-2.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/76172233 "悬停显示") |
| 235 | * | Lowest Common Ancestor of a Binary Search Tree | [Py-1](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree-1.py "悬停显示") [Py-2](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree-2.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/75497795 "悬停显示") |
| 501 | * | Find Mode in Binary Search Tree | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/501.Find%20Mode%20in%20Binary%20Search%20Tree/Find%20Mode%20in%20Binary%20Search%20Tree.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/501.Find%20Mode%20in%20Binary%20Search%20Tree/Find%20Mode%20in%20Binary%20Search%20Tree.cpp "悬停显示") | [博客思路讲解](http://blog.csdn.net/c406495762/article/details/76046469 "悬停显示") |
| 543 | * | Diameter of Binary Tree | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/543.Diameter%20of%20Binary%20Tree/Diameter%20of%20Binary%20Tree.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/543.Diameter%20of%20Binary%20Tree/Diameter%20of%20Binary%20Tree.cpp "悬停显示") | no |
| 606 | Easy | Construct String from Binary Tree | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/606.Construct%20String%20from%20Binary%20Tree/Construct%20String%20from%20Binary%20Tree.py "悬停显示") | [C++](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/606.Construct%20String%20from%20Binary%20Tree/Construct%20String%20from%20Binary%20Tree.cpp "悬停显示") | no |
| 113 | Medium | Path Sum II | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Medium/113.Path%20Sum%20II/Path%20Sum%20II.py "悬停显示") | no | no |
### Hash Table(哈希表)
| ID | Difficulty | Title | Python | C++ | Blog |
| ---- | :--------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: | :--------------------------------------: |
| 290 | Easy | Word Pattern.mde | [Python](https://github.com/Jack-Cherish/LeetCode/blob/master/Hash%20Table/Easy/290.Word%20Pattern.md "悬停显示") | no | [思路讲解](https://github.com/Jack-Cherish/LeetCode/blob/master/Hash%20Table/Easy/290.Word%20Pattern.md "悬停显示") |
# 剑指Offer（已完成）
* [个人网站](http://cuijiahua.com/ "悬停显示")
### 链表(8道)：
* [剑指Offer（三）：从尾到头打印链表](http://cuijiahua.com/blog/2017/11/basis_3.html "悬停显示")
* [剑指Offer（十四）：链表中倒数第k个结点](http://cuijiahua.com/blog/2017/12/basis_14.html "悬停显示")
* [剑指Offer（十五）：反转链表](http://cuijiahua.com/blog/2017/12/basis_15.html "悬停显示")
* [剑指Offer（十六）：合并两个排序的链表](http://cuijiahua.com/blog/2017/12/basis_16.html "悬停显示")
* [剑指Offer（二十五）：复杂链表的复制](http://cuijiahua.com/blog/2017/12/basis_25.html "悬停显示")
* [剑指Offer（三十六）：两个链表的第一个公共结点](http://cuijiahua.com/blog/2018/01/basis_36.html "悬停显示")
* [剑指Offer（五十五）：链表中环的入口结点](http://cuijiahua.com/blog/2018/01/basis_55.html "悬停显示")
* [剑指Offer（五十六）：删除链表中重复的结点](http://cuijiahua.com/blog/2018/01/basis_56.html "悬停显示")
### 二叉树(12道)：
* [剑指Offer（四）：重建二叉树](http://cuijiahua.com/blog/2017/11/basis_4.html "悬停显示")
* [剑指Offer（十七）：树的子结构](http://cuijiahua.com/blog/2017/12/basis_17.html "悬停显示")
* [剑指Offer（十八）：二叉树的镜像](http://cuijiahua.com/blog/2017/12/basis_18.html "悬停显示")
* [剑指Offer（二十二）：从上往下打印二叉树](http://cuijiahua.com/blog/2017/12/basis_22.html "悬停显示")
* [剑指Offer（二十四）：二叉树中和为某一值的路径](http://cuijiahua.com/blog/2017/12/basis_24.html "悬停显示")
* [剑指Offer（三十八）：二叉树的深度](http://cuijiahua.com/blog/2018/01/basis_38.html "悬停显示")
* [剑指Offer（三十九）：平衡二叉树](http://cuijiahua.com/blog/2018/01/basis_39.html "悬停显示")
* [剑指Offer（五十七）：二叉树的下一个结点](http://cuijiahua.com/blog/2018/01/basis_57.html "悬停显示")
* [剑指Offer（五十八）：对称的二叉树](http://cuijiahua.com/blog/2018/01/basis_58.html "悬停显示")
* [剑指Offer（五十九）：按之字顺序打印二叉树](http://cuijiahua.com/blog/2018/01/basis_59.html "悬停显示")
* [剑指Offer（六十）：把二叉树打印成多行](http://cuijiahua.com/blog/2018/01/basis_60.html "悬停显示")
* [剑指Offer（六十一）：序列化二叉树](http://cuijiahua.com/blog/2018/01/basis_61.html "悬停显示")
### 二叉搜索树(3道)：
* [剑指Offer（二十三）：二叉搜索树的后序遍历序列](http://cuijiahua.com/blog/2017/12/basis_23.html "悬停显示")
* [剑指Offer（二十六）：二叉搜索树与双向链表](http://cuijiahua.com/blog/2017/12/basis_26.html "悬停显示")
* [剑指Offer（六十二）：二叉搜索树的第k个结点](http://cuijiahua.com/blog/2018/01/basis_62.html "悬停显示")
### 数组(11道)：
* [剑指Offer（一）：二维数组中的查找](http://cuijiahua.com/blog/2017/11/basis_1.html "悬停显示")
* [剑指Offer（六）：旋转数组的最小数字](http://cuijiahua.com/blog/2017/11/basis_6.html "悬停显示")
* [剑指Offer（十三）：调整数组顺序使奇数位于偶数前面](http://cuijiahua.com/blog/2017/11/basis_13.html "悬停显示")
* [剑指Offer（二十八）：数组中出现次数超过一半的数字](http://cuijiahua.com/blog/2017/12/basis_28.html "悬停显示")
* [剑指Offer（三十）：连续子数组的最大和](http://cuijiahua.com/blog/2017/12/basis_30.html "悬停显示")
* [剑指Offer（三十二）：把数组排成最小的数](http://cuijiahua.com/blog/2018/01/basis_32.html "悬停显示")
* [剑指Offer（三十五）：数组中的逆序对](http://cuijiahua.com/blog/2018/01/basis_35.html "悬停显示")
* [剑指Offer（三十七）：数字在排序数组中出现的次数](http://cuijiahua.com/blog/2018/01/basis_37.html "悬停显示")
* [剑指Offer（四十）：数组中只出现一次的数字](http://cuijiahua.com/blog/2018/01/basis_40.html "悬停显示")
* [剑指Offer（五十）：数组中重复的数字](http://cuijiahua.com/blog/2018/01/basis_50.html "悬停显示")
* [剑指Offer（五十一）：构建乘积数组](http://cuijiahua.com/blog/2018/01/basis_51.html "悬停显示")
### 字符串(8道)：
* [剑指Offer(二)：替换空格](http://cuijiahua.com/blog/2017/11/basis_2.html "悬停显示")
* [剑指Offer（二十七）：字符串的排列](http://cuijiahua.com/blog/2017/12/basis_27.html "悬停显示")
* [剑指Offer（三十四）：第一个只出现一次的字符](http://cuijiahua.com/blog/2018/01/basis_34.html "悬停显示")
* [剑指Offer（四十三）：左旋转字符串](http://cuijiahua.com/blog/2018/01/basis_43.html "悬停显示")
* [剑指Offer（四十四）：翻转单词顺序序列](http://cuijiahua.com/blog/2018/01/basis_44.html "悬停显示")
* [剑指Offer（四十九）：把字符串转换成整数](http://cuijiahua.com/blog/2018/01/basis_49.html "悬停显示")
* [剑指Offer（五十二）：正则表达式匹配](http://cuijiahua.com/blog/2018/01/basis_52.html "悬停显示")
* [剑指Offer（五十三）：表示数值的字符串](http://cuijiahua.com/blog/2018/01/basis_53.html "悬停显示")
### 栈(3道)：
* [剑指Offer（五）：用两个栈实现队列](http://cuijiahua.com/blog/2017/11/basis_5.html "悬停显示")
* [剑指Offer（二十）：包含min函数的栈](http://cuijiahua.com/blog/2017/12/basis_20.html "悬停显示")
* [剑指Offer（二十一）：栈的压入、弹出序列](http://cuijiahua.com/blog/2017/12/basis_21.html "悬停显示")
### 递归(4道)：
* [剑指Offer（七）：裴波那契数列](http://cuijiahua.com/blog/2017/11/basis_7.html "悬停显示")
* [剑指Offer（八）：跳台阶](http://cuijiahua.com/blog/2017/11/basis_8.html "悬停显示")
* [剑指Offer（九）：变态跳台阶](http://cuijiahua.com/blog/2017/11/basis_9.html "悬停显示")
* [剑指Offer（十）：矩形覆盖](http://cuijiahua.com/blog/2017/11/basis_10.html "悬停显示")
### 回溯法(2道)：
* [剑指Offer（六十五）：矩阵中的路径](http://cuijiahua.com/blog/2018/02/basis_65.html "悬停显示")
* [剑指Offer（六十六）：机器人的运动范围](http://cuijiahua.com/blog/2018/02/basis_66.html "悬停显示")
### 其他(15道)：
* [剑指Offer（十一）：二进制中1的个数](http://cuijiahua.com/blog/2017/11/basis_11.html "悬停显示")
* [剑指Offer（十二）：数值的整数次方](http://cuijiahua.com/blog/2017/11/basis_12.html "悬停显示")
* [剑指Offer（十九）：顺时针打印矩阵](http://cuijiahua.com/blog/2017/12/basis_19.html "悬停显示")
* [剑指Offer（二十九）：最小的K个数](http://cuijiahua.com/blog/2017/12/basis_29.html "悬停显示")
* [剑指Offer（三十一）：整数中1出现的次数（从1到n整数中1出现的次数）](http://cuijiahua.com/blog/2017/12/basis_31.html "悬停显示")
* [剑指Offer（三十三）：丑数](http://cuijiahua.com/blog/2018/01/basis_33.html "悬停显示")
* [剑指Offer（四十一）：和为S的连续正数序列](http://cuijiahua.com/blog/2018/01/basis_41.html "悬停显示")
* [剑指Offer（四十二）：和为S的两个数字](http://cuijiahua.com/blog/2018/01/basis_42.html "悬停显示")
* [剑指Offer（四十五）：扑克牌顺子](http://cuijiahua.com/blog/2018/01/basis_45.html "悬停显示")
* [剑指Offer（四十六）：孩子们的游戏（圆圈中最后剩下的数）](http://cuijiahua.com/blog/2018/01/basis_46.html "悬停显示")
* [剑指Offer（四十七）：求1+2+3+…+n](http://cuijiahua.com/blog/2018/01/basis_47.html "悬停显示")
* [剑指Offer（四十八）：不用加减乘除的加法](http://cuijiahua.com/blog/2018/01/basis_48.html "悬停显示")
* [剑指Offer（五十四）：字符流中第一个不重复的字符](http://cuijiahua.com/blog/2018/01/basis_54.html "悬停显示")
* [剑指Offer（六十三）：数据流中的中位数](http://cuijiahua.com/blog/2018/02/basis_63.html "悬停显示")
* [剑指Offer（六十四）：滑动窗口的最大值](http://cuijiahua.com/blog/2018/02/basis_64.html "悬停显示")
更多精彩，敬请期待！
