leetcode/notes/src/SUMMARY.md

# Summary

# 数组

- [总结](./array.md)
- [二分查找](./bin_search.md)
- [移除元素](./remove_elements.md)
- [长度最小的子数组](./minimum_size_subarray_sum.md)
- [三数相加](./three_sum.md)

# 链表

- [总结](./linked_list.md)
- [环形链表](./linked_list_cycle.md)

# 哈希表

- [总结](./hash_table.md)
- [四数相加 II](./four_sum_ii.md)

# 字符串

- [总结](./string.md)
- [替换空格](./substitute_spaces.md)
- [翻转字符串里的单词](./reverse_words_in_a_string.md)
- [左旋转字符串](./reverse_left_words.md)
- [KMP](./kmp.md)
- [重复的子字符串](./repeated_substring_pattern.md)

# 栈与队列

- [总结](./stack_and_queue.md)
- [用栈实现队列 && 用队列实现栈](./impl_stack_queue.md)

# 二叉树

- [理论基础](./btree_basic.md)
- [遍历](./btree_iter.md)
- [二叉搜索树](./bstree.md)

# 回溯

- [总结](./backtrack.md)
- [组合问题](./combinations.md)
- [切割问题](./split.md)
- [子集问题](./subsets.md)
- [排列问题](./permute.md)
- [棋盘问题](./chess.md)

# 贪心算法

- [总结](./greedy.md)

# 动态规划

- [总结](./dynamic-programming.md)
- [基础问题](./dynamic-programming-basic.md)
- [背包问题](./knapsack.md)
- [打家劫舍](./house-robber.md)
- [股票问题](./stock.md)
- [子序列问题](./subsequence.md)

# STL

- [总结](./stl.md)
- [排序](./stl_sorting.md)
- [哈希表](./stl_hash_table.md)
- [字符串](./stl_string.md)
- [向量](./stl_vector.md)
- [优先级队列](./stack_and_queue.md)

# 经典代码

- [排序算法](./sorting.md)
- [二分查找](./bin_search.md)
- [KMP](./kmp.md)
- [单调队列](./stack_and_queue.md)
- [二叉树遍历](./btree_iter.md)
- [合并两个有序链表](./merge_two_sorted_linked_lists.md)
- [LRU](./lru_cache.md)