学习重点

按照如下类型来刷数组-> 链表-> 哈希表->字符串->栈与队列->树->回溯->贪心->动态规划->图论->高级数据结构，再从简单刷起，做了几个类型题目之后，再慢慢做中等题目、困难题目。

插入「脑图」并进行编辑

一、数组；链表；栈与队列、优先队列、双端队列

1、数组的基本知识
2、盛更多水的容器：https://leetcode-cn.com/problems/container-with-most-water/
3、移动零：https://leetcode-cn.com/problems/move-zeroes/
4、爬楼梯：https://leetcode.com/problems/climbing-stairs/
5、三数之和：https://leetcode-cn.com/problems/3sum/ (高频老题）
6、有效的括号：https://leetcode-cn.com/problems/valid-parentheses/
7、柱状图中最大的矩形：https://leetcode-cn.com/problems/largest-rectangle-in-histogram
8、滑动窗口最大值：https://leetcode-cn.com/problems/sliding-window-maximum

9、删除排序数组中的重复项：https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
10、旋转数组：https://leetcode-cn.com/problems/rotate-array/
11、合并两个有序数组：https://leetcode-cn.com/problems/merge-sorted-array/
12、两数之和：https://leetcode-cn.com/problems/two-sum/
13、加1：https://leetcode-cn.com/problems/plus-one/
14、设计循环双端队列：https://leetcode.com/problems/design-circular-deque
15、接雨水：https://leetcode.com/problems/trapping-rain-water/

1、链表的基本知识
2、反转链表：https://leetcode.com/problems/reverse-linked-list/
3、两两交换链表中的节点：https://leetcode-cn.com/problems/swap-nodes-in-pairs/
4、环形链表：https://leetcode.com/problems/linked-list-cycle
5、环形链表II：https://leetcode-cn.com/problems/linked-list-cycle-ii/
6、K 个一组翻转链表：https://leetcode.com/problems/reverse-nodes-in-k-group/
7、合并两个有序链表：https://leetcode-cn.com/problems/merge-two-sorted-lists/

三、哈希表、映射、集合；树、二叉树、二叉搜索树；堆和二叉堆、图

1、栈与队列、优先队列、双端队列基本知识
2、有效的字母异位词 https://leetcode-cn.com/problems/valid-anagram/
3、字母异位词分组 https://leetcode-cn.com/problems/group-anagrams/
4、两数之和 https://leetcode-cn.com/problems/two-sum/description/
5、二叉树的中序遍历 https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
6、二叉树的前序遍历 https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
7、N叉树的后序遍历 https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/
8、N叉树的前序遍历 https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/
9、N叉树的层序遍历 https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/
10、最小的k个数 https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/
11、滑动窗口最大值 https://leetcode-cn.com/problems/sliding-window-maximum
12、丑数 https://leetcode-cn.com/problems/chou-shu-lcof/
13、前 K 个高频元素 https://leetcode-cn.com/problems/top-k-frequent-elements/

七、递归、树的递归；分治、回溯算法

爬楼梯 https://leetcode.com/problems/climbing-stairs/
括号生成 https://leetcode-cn.com/problems/generate-parentheses/#/description
翻转二叉树 https://leetcode-cn.com/problems/invert-binary-tree/description/
验证二叉搜索树 https://leetcode-cn.com/problems/validate-binary-search-tree/
二叉树的最大深度 https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
二叉树的最小深度 https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/
二叉树的序列化与反序列化 https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/
Pow(x, n) https://leetcode-cn.com/problems/powx-n/
子集 https://leetcode-cn.com/problems/subsets/
多数元素 https://leetcode-cn.com/problems/majority-element/description/
电话号码的字母组合 https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/
N皇后 https://leetcode-cn.com/problems/n-queens/

二叉树的最近公共祖先 https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
从前序与中序遍历序列构造二叉树 https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
组合 https://leetcode-cn.com/problems/combinations/
全排列 https://leetcode-cn.com/problems/permutations/
全排列 II https://leetcode-cn.com/problems/permutations-ii/

八、深度优先搜索和广度优先搜索；贪心算法；二分查找

二叉树的层次遍历 https://leetcode-cn.com/problems/binary-tree-level-order-traversal/#/description
最小基因变化 https://leetcode-cn.com/problems/minimum-genetic-mutation/#/description
括号生成 https://leetcode-cn.com/problems/generate-parentheses/#/description
在每个树行中找最大值 https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/#/description
x的平方根 https://leetcode-cn.com/problems/sqrtx/
有效的完全平方数 https://leetcode-cn.com/problems/valid-perfect-square/




柠檬水找零 https://leetcode-cn.com/problems/lemonade-change/description/
买卖股票的最佳时机 II https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/
分发饼干 https://leetcode-cn.com/problems/assign-cookies/description/
模拟行走机器人 https://leetcode-cn.com/problems/walking-robot-simulation/description/
单词接龙 https://leetcode-cn.com/problems/word-ladder/description/
岛屿数量 https://leetcode-cn.com/problems/number-of-islands/
扫雷游戏 https://leetcode-cn.com/problems/minesweeper/description/
跳跃游戏 https://leetcode-cn.com/problems/jump-game/
搜索旋转排序数组 https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
搜索二维矩阵 https://leetcode-cn.com/problems/search-a-2d-matrix/
寻找旋转排序数组中的最小值 https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
单词接龙II https://leetcode-cn.com/problems/word-ladder-ii/description/
跳跃游戏 II https://leetcode-cn.com/problems/jump-game-ii/

十一、动态规划

初级DP：

不同路径 https://leetcode-cn.com/problems/unique-paths/
不同路径 II https://leetcode-cn.com/problems/unique-paths-ii/
最长公共子序列 https://leetcode-cn.com/problems/longest-common-subsequence/
爬楼梯 https://leetcode-cn.com/problems/climbing-stairs/description/
三角形最小路径和 https://leetcode-cn.com/problems/triangle/description/
最大子序和 https://leetcode-cn.com/problems/maximum-subarray/
乘积最大子数组 https://leetcode-cn.com/problems/maximum-product-subarray/description/
零钱兑换 https://leetcode-cn.com/problems/coin-change/
打家劫舍 https://leetcode-cn.com/problems/house-robber/
打家劫舍 II https://leetcode-cn.com/problems/house-robber-ii/description/
买卖股票的最佳时机 https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description
买卖股票的最佳时机 II https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
买卖股票的最佳时机 III https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
买卖股票的最佳时机含冷冻期 https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
买卖股票的最佳时机 IV https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
买卖股票的最佳时机含手续费 https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/

高级DP：
完全平方数 https://leetcode-cn.com/problems/perfect-squares/
编辑距离 https://leetcode-cn.com/problems/edit-distance/ （重点）
跳跃游戏 https://leetcode-cn.com/problems/jump-game/
跳跃游戏 II https://leetcode-cn.com/problems/jump-game-ii/
不同路径 III https://leetcode-cn.com/problems/unique-paths-iii/
零钱兑换 II https://leetcode-cn.com/problems/coin-change-2/

DP作业：
最小路径和 https://leetcode-cn.com/problems/minimum-path-sum/
解码方法 https://leetcode-cn.com/problems/decode-ways
最大正方形 https://leetcode-cn.com/problems/maximal-square/
任务调度器 https://leetcode-cn.com/problems/task-scheduler/
回文子串 https://leetcode-cn.com/problems/palindromic-substrings/
最长有效括号 https://leetcode-cn.com/problems/longest-valid-parentheses/
矩形区域不超过K的最大数值和 https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/
青蛙过河 https://leetcode-cn.com/problems/frog-jump/
分割数组的最大值 https://leetcode-cn.com/problems/split-array-largest-sum
学生出勤记录 II https://leetcode-cn.com/problems/student-attendance-record-ii/
最小覆盖子串 https://leetcode-cn.com/problems/minimum-window-substring/
戳气球 https://leetcode-cn.com/problems/burst-balloons/

十三、并查集和字典树；高级搜索；红黑树和AVL树

实现 Trie (前缀树) https://leetcode-cn.com/problems/implement-trie-prefix-tree/
单词搜索 II https://leetcode-cn.com/problems/word-search-ii/
朋友圈 https://leetcode-cn.com/problems/friend-circles
岛屿数量 https://leetcode-cn.com/problems/number-of-islands/
被围绕的区域 https://leetcode-cn.com/problems/surrounded-regions/
爬楼梯 https://leetcode-cn.com/problems/climbing-stairs/
括号生成 https://leetcode-cn.com/problems/generate-parentheses/
N皇后 https://leetcode-cn.com/problems/n-queens/
有效的数独 https://leetcode-cn.com/problems/valid-sudoku/
解数独 https://leetcode-cn.com/problems/sudoku-solver/
单词接龙 https://leetcode-cn.com/problems/word-ladder/
最小基因变化 https://leetcode-cn.com/problems/minimum-genetic-mutation/
二进制矩阵中的最短路径 https://leetcode-cn.com/problems/shortest-path-in-binary-matrix/
滑动谜题 https://leetcode-cn.com/problems/sliding-puzzle/

十七、位运算

十八、布隆过滤器和LRU缓存

十九、排序算法

二十、高级动态规划

二十一、字符串算法

学习资源

课堂PPT

嵌入「本地文件」，在文档中可预览此文件：

脑图（XMind、Mind Manager、Mind Node） 设计文件（PhotoShop、Sketch、Axure) 办公文件（PDF、PPT、Word、Excel、Keynote、Pages、Numbers）

教学视频

嵌入「本地视频」或「在线视频」，如优酷及Bilibili视频：

阅读材料

插入「附件」

示例PDF.pdf

学习计划

插入「表格」，可以在表格框里插入对应的图片、附件、状态

书名	章节	计划阅读时间	进程
《基础有机化学》	第三章	2h	已完成
《无机化学》	第一章	1h	进行中
《物理化学》	第四章	1h	未开始