2019-03-08 21:41:45 +08:00
|
|
|
<!-- GFM-TOC -->
|
|
|
|
|
* [算法思想](#算法思想)
|
|
|
|
|
* [数据结构相关](#数据结构相关)
|
|
|
|
|
* [参考资料](#参考资料)
|
|
|
|
|
<!-- GFM-TOC -->
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
# 算法思想
|
|
|
|
|
|
|
|
|
|
- [双指针](notes/Leetcode%20题解%20-%20双指针.md)
|
|
|
|
|
- [排序](notes/Leetcode%20题解%20-%20排序.md)
|
|
|
|
|
- [贪心思想](notes/Leetcode%20题解%20-%20贪心思想.md)
|
|
|
|
|
- [二分查找](notes/Leetcode%20题解%20-%20二分查找.md)
|
|
|
|
|
- [分治](notes/Leetcode%20题解%20-%20分治.md)
|
|
|
|
|
- [搜索](notes/Leetcode%20题解%20-%20搜索.md)
|
|
|
|
|
- [动态规划](notes/Leetcode%20题解%20-%20动态规划.md)
|
|
|
|
|
- [数学](notes/Leetcode%20题解%20-%20数学.md)
|
|
|
|
|
|
|
|
|
|
# 数据结构相关
|
|
|
|
|
|
|
|
|
|
- [链表](notes/Leetcode%20题解%20-%20链表.md)
|
|
|
|
|
- [树](notes/Leetcode%20题解%20-%20树.md)
|
|
|
|
|
- [栈和队列](notes/Leetcode%20题解%20-%20栈和队列.md)
|
|
|
|
|
- [哈希表](notes/Leetcode%20题解%20-%20哈希表.md)
|
|
|
|
|
- [字符串](notes/Leetcode%20题解%20-%20字符串.md)
|
|
|
|
|
- [数组与矩阵](notes/Leetcode%20题解%20-%20数组与矩阵.md)
|
|
|
|
|
- [图](notes/Leetcode%20题解%20-%20图.md)
|
|
|
|
|
- [位运算](notes/Leetcode%20题解%20-%20位运算.md)
|
|
|
|
|
|
|
|
|
|
# 参考资料
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
- Leetcode
|
|
|
|
|
- Weiss M A, 冯舜玺. 数据结构与算法分析——C 语言描述[J]. 2004.
|
|
|
|
|
- Sedgewick R. Algorithms[M]. Pearson Education India, 1988.
|
|
|
|
|
- 何海涛, 软件工程师. 剑指 Offer: 名企面试官精讲典型编程题[M]. 电子工业出版社, 2014.
|
|
|
|
|
- 《编程之美》小组. 编程之美[M]. 电子工业出版社, 2008.
|
|
|
|
|
- 左程云. 程序员代码面试指南[M]. 电子工业出版社, 2015.
|
