清单_滴答cef内核版下载-CSDN博客

本文链接：https://blog.csdn.net/M__D_Luffy/article/details/77796977

***************************Day1*******************************
反转链表：
1.[LeetCode]206.Reverse Linked List — 最原始的单纯的反转链表
http://blog.csdn.net/iamxiaofeifei/article/details/77075021

2.[LeetCode]92.Reverse Linked List II — 区间内局部反转链表
http://blog.csdn.net/iamxiaofeifei/article/details/77075174

3.[LeetCode]83. Remove Duplicates from Sorted List — 从已排序的链表中删除重复节点
http://blog.csdn.net/iamxiaofeifei/article/details/77075230

4.[LeetCode]82. Remove Duplicates from Sorted List II — 已排序，重复出现的节点都删除
http://blog.csdn.net/iamxiaofeifei/article/details/77113548

5.[剑指offer]5.从尾到头打印链表 — 【递归和栈实现两种方法】

http://blog.csdn.net/iamxiaofeifei/article/details/77113710

6.[LeetCode]237.Delete Node in a Linked List — 给定节点指针，删除链表中的一个节点
http://blog.csdn.net/iamxiaofeifei/article/details/77116024

7.[LeetCode]141.Linked List Cycle — 判断一个链表中是否有环【快慢指针应用】
http://blog.csdn.net/iamxiaofeifei/article/details/77116173

8.[LeetCode]142.Linked List Cycle II — 找到链表中环的入口节点【先找环中节点，再计算环长度，指针先行，碰头则为入口】
http://blog.csdn.net/iamxiaofeifei/article/details/77140854

9.[剑指offer]15.链表中倒数第K个节点 — 【两个指针，其中一个先行k步】

http://blog.csdn.net/iamxiaofeifei/article/details/77140954

10.[LeetCode]19.Remove Nth Node From End of List — 移除倒数第N个节点【相比第9题，多一步删除，多一个哑节点】
http://blog.csdn.net/iamxiaofeifei/article/details/77145897

***************************Day2*******************************
1.[剑指offer]37.两个链表中的第一个公共节点

http://blog.csdn.net/iamxiaofeifei/article/details/77141056

2.[剑指offer]面试题45.圆圈中最后剩下的数字 — 【循环链表模拟圆圈，或者数学公式递归实现】

3.[LeetCode]61.Rotate List
http://blog.csdn.net/iamxiaofeifei/article/details/77146078

4.[LeetCode]21.Merge Two Sorted Lists
http://blog.csdn.net/iamxiaofeifei/article/details/77146115

5.[LeetCode]2.Add Two Numbers
http://blog.csdn.net/iamxiaofeifei/article/details/77146167

6.[LeetCode]445.Add Two Numbers II
http://blog.csdn.net/iamxiaofeifei/article/details/77146207

7.[LeetCode]143.Reorder List — 首尾首尾这样重新排列
http://blog.csdn.net/iamxiaofeifei/article/details/77146241

8.[LeetCode]86.Partition List — 给一个数字，将小于此数的放左侧
http://blog.csdn.net/iamxiaofeifei/article/details/77148168

9.[LeetCode]24.Swap Nodes in Pairs
http://blog.csdn.net/iamxiaofeifei/article/details/77152329

10.[LeetCode]148.Sort List — 还没做过

***************************Day3*******************************
1.[LeetCode]328.Odd Even Linked List — 按照先奇数后偶数的顺序排序
http://blog.csdn.net/iamxiaofeifei/article/details/77152349

2.[LeetCode]203.Remove Linked List Element — 给定一个数值，删除值相同的节点
http://blog.csdn.net/iamxiaofeifei/article/details/77152390

3.[LeetCode]147.Insertion Sort List — 使用插入排序对链表进行排序
http://blog.csdn.net/iamxiaofeifei/article/details/77152363

4.[LeetCode]234.Palindrome Linked List — 看链表是不是回文的
http://blog.csdn.net/iamxiaofeifei/article/details/77152376

5.[LeetCode]138.Copy List with Random Pointer — 复杂链表的复制

6.[LeetCode]109.Convert Sorted List to Binary Search Tree — 把排序链表转换成平衡的二叉搜索树

7.[剑指offer]27.二叉搜索树与双向链表

***************************Day4*******************************
二叉树的5种遍历方式：

1.前序遍历
[LeetCode]144. Binary Tree Preorder Traversal
http://blog.csdn.net/iamxiaofeifei/article/details/76613406

2.中序遍历
[LeetCode]94. Binary Tree Inorder Traversal
http://blog.csdn.net/iamxiaofeifei/article/details/76614898

[LeetCode]230. Kth Smallest Element in a BST – 二叉搜索树的第k个结点中序遍历搞定
http://blog.csdn.net/iamxiaofeifei/article/details/77389100

[剑指offer]面试题58：二叉树中的下一个结点 – 中序遍历中的下一个节点，且每个节点带指向父节点的指针
http://blog.csdn.net/iamxiaofeifei/article/details/77388955

3.后序遍历
[LeetCode]145. Binary Tree Postorder Traversal
http://blog.csdn.net/iamxiaofeifei/article/details/76618812

[LeetCode]110. Balanced Binary Tree – 后序遍历的应用
http://blog.csdn.net/iamxiaofeifei/article/details/77453329

4.层序
[LeetCode]102. Binary Tree Level Order Traversal
http://blog.csdn.net/iamxiaofeifei/article/details/76674085

[LeetCode]107. Binary Tree Level Order Traversal II（结果反转一下即可）
http://blog.csdn.net/iamxiaofeifei/article/details/76682714

5.之字形遍历
[LeetCode]103. Binary Tree Zigzag Level Order Traversal
http://blog.csdn.net/iamxiaofeifei/article/details/76684782

反转二叉树：
[LeetCode]226. Invert Binary Tree – 二叉树的镜像/反转二叉树，递归循环都得熟练
http://blog.csdn.net/iamxiaofeifei/article/details/76602562

树的深度：

[LeetCode]104. Maximum Depth of Binary Tree—树的最大深度（3种方法：递归、层次遍历、后序遍历）
http://blog.csdn.net/iamxiaofeifei/article/details/76596067

[LeetCode]111. Minimum Depth of Binary Tree—树的最小深度
http://blog.csdn.net/iamxiaofeifei/article/details/76599039

***************************Day5*******************************
二叉树的重建（重建必须有中序遍历）：
[LeetCode]105. Construct Binary Tree from Preorder and Inorder Traversal（利用前序+中序重建）
http://blog.csdn.net/iamxiaofeifei/article/details/77365792

[LeetCode]106. Construct Binary Tree from Inorder and Postorder Traversal（利用中序+后序重建）
http://blog.csdn.net/iamxiaofeifei/article/details/77388933

二叉树的路径：

[LeetCode]112. Path Sum – 二叉树中和为某一值的路径（根到叶），只是判断，不记录
http://blog.csdn.net/iamxiaofeifei/article/details/77479264

[LeetCode]113. Path Sum II – 二叉树中和为某一值的路径（根到叶），记录所有路径,递归+回溯
http://blog.csdn.net/iamxiaofeifei/article/details/77479781

[LeetCode]437. Path Sum III – 不要求根到叶，中间路径也可以,只问有几条，没说要记录
http://blog.csdn.net/iamxiaofeifei/article/details/77480156

[LeetCode]129. Sum Root to Leaf Numbers – 一条根到叶的路径组成一个数，求和，递归实现
http://blog.csdn.net/iamxiaofeifei/article/details/77480737

[LeetCode]404. Sum of Left Leaves – 左叶节点的和，递归/层序迭代遍历BFS
http://blog.csdn.net/iamxiaofeifei/article/details/77481222

[LeetCode]257. Binary Tree Paths

二叉树的判断：

[LeetCode]100. Same Tree–判断是不是相同的树
http://blog.csdn.net/iamxiaofeifei/article/details/76602644

[LeetCode]572. Subtree of Another Tree – 判断是不是树的子树
http://blog.csdn.net/iamxiaofeifei/article/details/77461810
LeetCode的这题和剑指offer上的题目还是有些不一样,一个强调的是子树,一个强调的是子结构

[剑指offer]面试题8：树的子结构
http://blog.csdn.net/iamxiaofeifei/article/details/77462234

[LeetCode]101. Symmetric Tree—判断是不是对称二叉树
http://blog.csdn.net/iamxiaofeifei/article/details/77389156

***************************Day6*******************************
祖先：

[LeetCode]235. Lowest Common Ancestor of a Binary Search Tree – 树中两个结点的最低公共祖先

[LeetCode]236. Lowest Common Ancestor of a Binary Tree

二叉搜索树：
[LeetCode]450. Delete Node in a BST

[剑指offer]面试题27：二叉搜索树与双向链表
[LeetCode]108. Convert Sorted Array to Binary Search Tree
[LeetCode]96. Unique Binary Search Trees
[LeetCode]95. Unique Binary Search Trees II
[LeetCode]98. Validate Binary Search Tree
[LeetCode]99. Recover Binary Search Tree
[LeetCode]98. Validate Binary Search Tree

***************************Day7*******************************
[剑指offer]面试题62：序列化二叉树
[LeetCode]116. Populating Next Right Pointers in Each Node
[LeetCode]117. Populating Next Right Pointers in Each Node II
[LeetCode]222. Count Complete Tree Nodes

***************************Day8*******************************
动态规划
283. Move Zeroes
27. Remove Element
26. Remove Duplicates from Sorted Array
80. Remove Duplicates from Sorted Array II
70.Climbing Stairs
120. Triangle
64. Minimum Path Sum
343. Integer Break

***************************Day8*******************************
279. Perfect Squares
91. Decode Ways
62. Unique Paths
63. Unique Paths II
198. House Robber
213. House Robber II
337. House Robber III
309. Best Time to Buy and Sell Stock with Cooldown

***************************Day10*******************************
栈、队列、优先队列
20. Valid Parentheses
150. Evaluate Reverse Polish Notation
71. Simplify Path
144. Binary Tree Preorder Traversal
94. Binary Tree Inorder Traversal
145. Binary Tree Postorder Traversal
341. Flatten Nested List Iterator
102. Binary Tree Level Order Traversal
107. Binary Tree Level Order Traversal II
103. Binary Tree Zigzag Level Order Traversal
199. Binary Tree Right Side View
279. Perfect Squares
127. Word Ladder
126. Word Ladder II
347. Top K Frequent Elements
23. Merge k Sorted Lists

***************************Day11*******************************
递归和回溯
17. Letter Combinations of a Phone Number
93. Restore IP Addresses
131. Palindrome Partitioning
46. Permutations
47. Permutations II
77. Combinations
39. Combination Sum
40. Combination Sum II
216. Combination Sum III
***************************Day*******************************

***************************Day12*******************************
78. Subsets
90. Subsets II
401. Binary Watch
79. Word Search
200. Number of Islands
130. Surrounded Regions
417. Pacific Atlantic Water Flow
51. N-Queens
52. N-Queens II
37. Sudoku Solver

***************************Day12*******************************
快排
归并排序
插入排序
选择排序
冒泡排序
二分查找