leetcode刷题目录

淩亂°似流年 2023-02-11 03:18 20阅读 0赞

# 排序 #

交换类排序 – **冒泡排序** 鸡尾酒排序 奇偶排序 梳子排序 侏儒排序 **快速排序** 臭皮匠排序 Bogo 排序  
选择类排序 – **选择排序** **堆排序** Smooth 排序 笛卡尔树排序 锦标赛排序 圈排序  
插入类排序 – **插入排序** **希尔排序** 二叉查找树排序 图书馆排序 耐心排序  
归并类排序 – **归并排序** 梯级归并排序 振荡归并排序 多相归并排序 Strand 排序  
分布类排序 – 美国旗帜排序 珠排序 桶排序 **计数排序** 鸽巢排序 相邻图排序 **基数排序**  
混合类排序 – Tim 排序 内省排序 Spread 排序 UnShuffle 排序 J 排序  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poaXpoZW5nZ3Vhbg_size_16_color_FFFFFF_t_70]

*  [算法：动画演示各种排序算法][Link 1]
 *  [算法：稳定排序与非稳定排序][Link 2]
 *  [算法：冒泡排序][Link 3]
 *  [算法：奇偶排序][Link 4]
 *  [算法：选择排序][Link 5]
 *  [算法：直接插入排序][Link 6]
 *  [算法：希尔(shell)排序][shell]
 *  [算法：荷兰国旗问题][Link 7]
 *  [算法：什么是快速排序][Link 8]

[计数排序入门][Link 9]  
[什么是计数排序][Link 10]  
[桶排序][Link 11]  
[排序算法：桶排序、计数排序、基数排序][Link 12]

[如何构建一个大根堆][Link 13]  
[堆排序算法][Link 14]

[两路归并排序][Link 15]  
[归并排序][Link 16]

## 交换类排序 ##

*  [排序算法之冒泡排序][Link 3]
    
     *  贪心冒泡：将无序数组分为两个区间，一个内部，一个外部，我们尽可能的想要在内部找到最大的然后放到外部有序区间，不管内部是否有序
 *  [排序算法之鸡尾酒排序][Link 17]
    
     *  也叫做双向冒泡排序，可以对比**冒泡排序**
 *  [排序算法之奇偶排序][Link 4]
    
     *  并行算法
 *  [排序算法之梳子排序][Link 18]
    
     *  改良自泡沫排序和快速排序
     *  可以和希尔排序改良插入排序一样对照着看
 *  [排序算法之侏儒(地精)排序][Link 19]
    
     *  贪心、冒泡、地精排序的思想
 *  [排序算法之快速排序][Link 8]
    
     *  从冒泡排序演变而来的算法
     *  最好先弄清楚荷兰国旗问题，这样比较好理解
 *  [排序算法之臭皮匠排序][Link 20]
    
     *  不实用的排序

## 插入类排序 ##

## 选择类排序 ##

*  [排序算法之堆排序][Link 14]
    
     *  [如何构建一个大根堆][Link 13]

## 奇葩排序 ##

*  [搞笑排序之睡眠排序][Link 21]

# 栈 #

[Java使用数组实现栈][Java]  
[Java使用链表实现栈][Java 1]  
[面试题09. 用两个栈实现队列][09.]  
[面试题 03.04. 化栈为队][03.04.]

**单调栈：**

# 队列 #

[933. 最近的请求次数][933.]

# 链表 #

[203. 移除链表元素][203.]

*  要求：删除链表中值为val的元素
 *  条件：已知链表头节点&&val
 *  总结：因为这题没有说val是唯一的，所以必须遍历全部元素
    
     *  构建一个新链表：遍历元素，如果元素等于val，就跳过，否则作为新链表的值 【】
     *  构建一个新链表，dummp = new ListNode(-1)，dummp.next = head，pre = dummy，cur = head。当cur不为空时循环： 判断cur的值，如果值为val，令pre.next = cur.next，cur=cur.next, ，如果不为val，pre = cur, cur=cur.next，

[237. 删除链表中的节点|剑指 Offer 18. 删除链表的节点|面试题 02.03删除中间节点][203.]

*  要求：删除链表中间的某个节点
 *  条件：只能访问要删除的节点
 *  总结：一句话，杀人灭口的最好方法

[面试题 02.01. 移除重复节点][02.01.]

*  要求：删除未排序链表中的重复节点
 *  条件：已知链表头节点
 *  总结：
    
     *  常规解法是使用map或者set储存已经出现的元素，如果出现了就删除
     *  如果不使用缓冲区，可以使用冒泡排序的思想渐渐扩大缓冲区

[82. 删除排序链表中的重复元素 II][82. _ II]  
[83. 删除排序链表中的重复元素][83.]

*  要求：删除排序链表中的重复节点
 *  条件：已知链表头节点
 *  总结：一个cur指针指向head。当cur和cur.next都不为空【表示还有比较区间】时，比较当前节点和当前节点的下一个节点的值，如果相等就让cur指向当前节点的下下个节点，然后cur与下下个节点比较。。。如果当前节点与下一个节点不相等，就移动cur。
    
    --------------------

[141. 环形链表][141.]

*  要求：判断链表是否有环
 *  总结：快慢指针

[876. 链表的中间结点][876.]

*  要求：返回链表的中间节点
 *  总结：快慢指针

[剑指 Offer 22. 链表中倒数第k个节点| 面试题 02.02返回倒数第 k 个节点 ][Offer 22. _k_ _ 02.02_ k _]

*  要求：返回链表的倒数第k个节点
 *  总结：快慢指针

[面试题 02.07. 链表相交|剑指 Offer 52两个链表的第一个公共节点|160. 相交链表 ][02.07. _ Offer 52_160. _]

*  要求：返回链表的相交节点
 *  总结：快慢指针
    
    --------------------

[剑指 Offer 24反转链表 | 206 反转链表 ][Offer 24_ _ 206 _]  
[234. 回文链表|面试题 02.06 回文链表 ][234. _ 02.06 _]

--------------------

[21. 合并两个有序链表][21.]

链表所有的简单题都做完了

# 位运算 #

<table> 
 <thead> 
 <tr> 
 <th>题目</th> 
 <th>技巧</th> 
 <th>相似的题目</th> 
 <th>q其他</th> 
 </tr> 
 </thead> 
 <tbody> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105705837" rel="nofollow">1. 两数之和</a></td> 
 <td>暴力、hash</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106135859" rel="nofollow">2. 两数相加</a></td> 
 <td>链表、各位加法</td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106988069" rel="nofollow">445. 两数相加 II</a></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106380638" rel="nofollow">3. 无重复字符的最长子串</a></td> 
 <td>暴力、队列、双指针、滑动窗口</td> 
 <td>933. 最近的请求次数、、</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106144230" rel="nofollow">7. 整数反转</a></td> 
 <td>模拟</td> 
 <td></td> 
 <td>易错题</td> 
 </tr> 
 <tr> 
 <td><a href="https://editor.csdn.net/md/?articleId=105809001" rel="nofollow">20. 有效的括号</a></td> 
 <td>栈</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106146806" rel="nofollow">21. 合并两个有序链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106977664" rel="nofollow">24. 两两交换链表中的节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/107139340" rel="nofollow">82. 删除排序链表中的重复元素 II</a></td> 
 <td></td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106195137" rel="nofollow">83. 删除排序链表中的重复元素</a></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106195137" rel="nofollow">83. 删除排序链表中的重复元素</a></td> 
 <td></td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/107139340" rel="nofollow">82. 删除排序链表中的重复元素 II</a></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106986651" rel="nofollow">86. 分隔链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/107132491" rel="nofollow">92. 反转链表 II</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109696148" rel="nofollow">94. 二叉树的中序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110142519" rel="nofollow">95. 不同的二叉搜索树 II</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109968225" rel="nofollow">96. 不同的二叉搜索树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106800504" rel="nofollow">100. 相同的树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106811413" rel="nofollow">101. 对称二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106768220" rel="nofollow">102. 二叉树的层序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106757745" rel="nofollow">104. 二叉树的最大深度</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109826256" rel="nofollow">105. 从前序与中序遍历序列构造二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109823329" rel="nofollow">106. 从中序与后序遍历序列构造二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109273987" rel="nofollow">107. 二叉树的层次遍历 II</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106757745" rel="nofollow">108. 将有序数组转换为二叉搜索树</a></td> 
 <td>易错题</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106974012" rel="nofollow">109. 有序链表转换二叉搜索树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106799710" rel="nofollow">110. 平衡二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106807462" rel="nofollow">111. 二叉树的最小深度</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109543970" rel="nofollow">112. 路径总和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109822708" rel="nofollow">114. 二叉树展开为链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109942919" rel="nofollow">116. 填充每个节点的下一个右侧节点指针</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110005535" rel="nofollow">129. 求根到叶子节点数字之和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106119763" rel="nofollow">136. 只出现一次的数字</a></td> 
 <td>SET，异或</td> 
 <td>268. 缺失数字、、389. 找不同</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106976820" rel="nofollow">138. 复制带随机指针的链表</a></td> 
 <td>递归、哈希、迭代</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106991976" rel="nofollow">143. 重排链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109826509" rel="nofollow">144. 二叉树的前序遍历</a></td> 
 <td>递归、迭代</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109705176" rel="nofollow">145. 二叉树的后序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://editor.csdn.net/md?articleId=106983124" rel="nofollow">147. 对链表进行插入排序</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106980635" rel="nofollow">148.排序链表</a></td> 
 <td>归并</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106190997" rel="nofollow">160. 相交链表</a></td> 
 <td>栈、链表、双指针、遍历</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105681713" rel="nofollow">169. 多数元素</a></td> 
 <td>排序取中、哈希计数、随机取数统计次数、摩根投票法</td> 
 <td>[1287. 有序数组中出现次数超过25%的元素]、、[面试题 17.10. 主要元素]</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109704129" rel="nofollow">173. 二叉搜索树迭代器</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106288039" rel="nofollow">190. 颠倒二进制位</a></td> 
 <td>模拟位操作，分治法待研究</td> 
 <td></td> 
 <td>易错题</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106257787" rel="nofollow">191. 位1的个数</a></td> 
 <td>调用库函数、字符串模拟，位操作</td> 
 <td>面试题15. 二进制中1的个数</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110144205" rel="nofollow">199. 二叉树的右视图</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106220045" rel="nofollow">203. 移除链表元素</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://editor.csdn.net/md/?articleId=106213162" rel="nofollow">206. 反转链表</a></td> 
 <td>双指针、递归、头插法</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109751471" rel="nofollow">222. 完全二叉树的节点个数</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106264028" rel="nofollow">226. 翻转二叉树</a></td> 
 <td></td> 
 <td>面试题27. 二叉树的镜像</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109784696" rel="nofollow">230. 二叉搜索树中第K小的元素</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106264028" rel="nofollow">231. 2的幂</a></td> 
 <td>模拟、位运算</td> 
 <td>326. 3的幂、、342. 4的幂</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106216037" rel="nofollow">234. 回文链表</a></td> 
 <td>使用栈、反转整个链表，反转半个链表</td> 
 <td>9. 回文数</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106810001" rel="nofollow">235. 二叉搜索树的最近公共祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106802635" rel="nofollow">236. 二叉树的最近公共祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106179404" rel="nofollow">237. 删除链表中的节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109318873" rel="nofollow">257. 二叉树的所有路径</a></td> 
 <td>递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106120547" rel="nofollow">268. 缺失数字</a></td> 
 <td>数学、异或、排序</td> 
 <td>136. 只出现一次的数字、、389. 找不同</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106272896" rel="nofollow">326. 3的幂</a></td> 
 <td>递归、循环、查表、基准转换</td> 
 <td>231. 2的幂、、342. 4的幂</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106984999" rel="nofollow">328. 奇偶链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106273610" rel="nofollow">342. 4的幂</a></td> 
 <td>递归、循环、查找、位运算</td> 
 <td>；231. 2的幂、、326. 3的幂</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106281447" rel="nofollow">389. 找不同</a></td> 
 <td>位运算、map、桶计数、数学</td> 
 <td>268. 缺失数字</td> 
 <td>java中浮点数比较就是个坑</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109477897" rel="nofollow">404. 左叶子之和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109864487" rel="nofollow">429. N叉树的层序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106988069" rel="nofollow">445. 两数相加 II</a></td> 
 <td></td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106135859" rel="nofollow">2. 两数相加</a></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106257021" rel="nofollow">461. 汉明距离</a></td> 
 <td>位运算</td> 
 <td>面试题15. 二进制中1的个数</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106276804" rel="nofollow">476. 数字的补数</a></td> 
 <td>位操作</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109547138" rel="nofollow">501. 二叉搜索树中的众数</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110143205" rel="nofollow">508. 出现次数最多的子树元素和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105674254" rel="nofollow">509. 斐波那契数</a></td> 
 <td>循环、递归</td> 
 <td></td> 
 <td>递归树入门</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109752533" rel="nofollow">513. 找树左下角的值</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110148106" rel="nofollow">515. 在每个树行中找最大值</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106801335" rel="nofollow">530. 二叉搜索树的最小绝对差</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110202205" rel="nofollow">538. 把二叉搜索树转换为累加树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109539647" rel="nofollow">543. 二叉树的直径</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106785975" rel="nofollow">559. N叉树的最大深度</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109477664" rel="nofollow">563. 二叉树的坡度</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109569811" rel="nofollow">572. 另一个树的子树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106783157" rel="nofollow">589. N叉树的前序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106782122" rel="nofollow">590. N叉树的后序遍历</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109498328" rel="nofollow">606. 根据二叉树创建字符串</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106764887" rel="nofollow">617. 合并二叉树</a></td> 
 <td>递归、队列</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106789039" rel="nofollow">637. 二叉树的层平均值</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109476865" rel="nofollow">653. 两数之和 IV - 输入 BST</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109657220" rel="nofollow">654. 最大二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106790342" rel="nofollow">669. 修剪二叉搜索树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109629453" rel="nofollow">671. 二叉树中第二小的节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106282386" rel="nofollow">693. 交替位二进制数</a></td> 
 <td>字符串，位运算模拟、位运算</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106766460" rel="nofollow">700. 二叉搜索树中的搜索</a></td> 
 <td>递归、迭代</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109708936" rel="nofollow">701. 二叉搜索树中的插入操作</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105981806" rel="nofollow">709. 转换成小写字母</a></td> 
 <td></td> 
 <td></td> 
 <td>签到题</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106801335" rel="nofollow">783. 二叉搜索树节点最小距离</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106279053" rel="nofollow">762. 二进制表示中质数个计算置位</a></td> 
 <td>顺序逻辑</td> 
 <td>这题不要想复杂了，easy</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106078522" rel="nofollow">771. 宝石与石头</a></td> 
 <td>哈希，正则</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109785444" rel="nofollow">814. 二叉树剪枝</a></td> 
 <td></td> 
 <td>1325. 删除给定值的叶子节点</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106988260" rel="nofollow">817. 链表组件</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105976429" rel="nofollow">844. 比较含退格的字符串</a></td> 
 <td>栈、循环</td> 
 <td></td> 
 <td>使用栈的时候很容易出错</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106790840" rel="nofollow">872. 叶子相似的树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106189054" rel="nofollow">876. 链表的中间结点</a></td> 
 <td>双指针</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109949094" rel="nofollow">889. 根据前序和后序遍历构造二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://editor.csdn.net/md/?articleId=106785566" rel="nofollow">897. 递增顺序查找树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106255867" rel="nofollow">933. 最近的请求次数</a></td> 
 <td>队列(滑动窗口)</td> 
 <td>3. 无重复字符的最长子串</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106763492" rel="nofollow">938. 二叉搜索树的范围和</a></td> 
 <td>栈、递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110095376" rel="nofollow">951. 翻转等价二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106762586" rel="nofollow">965. 单值二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109941138" rel="nofollow">979. 在二叉树中分配硬币</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109785039" rel="nofollow">1008. 前序遍历构造二叉搜索树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/107088405" rel="nofollow">1019. 链表中的下一个更大节点</a></td> 
 <td>单调栈</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106805349" rel="nofollow">1022. 从根到叶的二进制数之和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110202562" rel="nofollow">1026. 节点与其祖先之间的最大差值</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109862361" rel="nofollow">1104. 二叉树寻路</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105978034" rel="nofollow">1108. IP 地址无效化</a></td> 
 <td></td> 
 <td></td> 
 <td>容易混肴的api</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110005168" rel="nofollow">1161. 最大层内元素和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109785229" rel="nofollow">1261. 在受污染的二叉树中查找元素</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105773470" rel="nofollow">1281. 整数的各位积和之差</a></td> 
 <td>模拟，递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105699785" rel="nofollow">1287. 有序数组中出现次数超过25%的元素</a></td> 
 <td>遍历、数组本身特性</td> 
 <td>[169. 多数元素]、、[面试题 17.10. 主要元素]</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105510950" rel="nofollow">1295. 统计位数为偶数的数字</a></td> 
 <td>模拟，数学</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109629923" rel="nofollow">1302. 层数最深叶子节点的和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109704540" rel="nofollow">1305. 两棵二叉搜索树中的所有元素</a></td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105711362" rel="nofollow">88. 合并两个有序数组</a></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105511799" rel="nofollow">1313. 解压缩编码列表</a></td> 
 <td>模拟</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109657785" rel="nofollow">1315. 祖父节点值为偶数的节点和</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109864040" rel="nofollow">1123. 最深叶节点的最近公共祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109784541" rel="nofollow">1325. 删除给定值的叶子节点</a></td> 
 <td>递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106080333" rel="nofollow">1342. 将数字变成 0 的操作次数</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105509523" rel="nofollow">1365. 有多少小于当前数字的数字</a></td> 
 <td>暴力，map，hash桶</td> 
 <td>这题有意思</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109629284" rel="nofollow">1379. 找出克隆二叉树中的相同节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105654911" rel="nofollow">1394. 找出数组中的幸运数</a></td> 
 <td>hash计数、桶计数、排序计数</td> 
 <td>[面试题 17.10. 主要元素]</td> 
 <td>先统计每个数的次数，然后在找到目标</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106078203" rel="nofollow">1450. 在既定时间做作业的学生人数</a></td> 
 <td>水题</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106078203" rel="nofollow">1431. 拥有最多糖果的孩子</a></td> 
 <td>脑子需要转一点点弯</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109824526" rel="nofollow">1448. 统计二叉树中好节点的数目</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106260504" rel="nofollow">判断一个数是偶数还是奇数</a></td> 
 <td>java中浮点数比较就是个坑</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106134672" rel="nofollow">为什么位运算可以实现加法</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105994411" rel="nofollow">面试题 01.03. URL化</a></td> 
 <td></td> 
 <td></td> 
 <td>一道坑人的题目</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106947034" rel="nofollow">面试题 02.01. 移除重复节点</a></td> 
 <td>set以及冒泡删除</td> 
 <td></td> 
 <td>冒泡删除可以以看，set就是常规无聊的解法</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106187331" rel="nofollow">面试题 02.02. 链表中倒数第k个节点</a></td> 
 <td>双指针、递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106179404" rel="nofollow">面试题 02.03. 删除中间节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106983269" rel="nofollow">面试题 02.04. 分割链表</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td>面试题 02.05. 链表求和</td> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106135859" rel="nofollow">2. 两数相加</a></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106216037" rel="nofollow">面试题 02.06 回文链表 </a></td> 
 <td>使用栈、反转半个链表、反转全部链表</td> 
 <td>反转半个链表很容易出错</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106190997" rel="nofollow">面试题 02.07. 链表相交</a></td> 
 <td>栈、链表、双指针、遍历</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109267464" rel="nofollow">面试题 04.02. 最小高度树</a></td> 
 <td>递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109682806" rel="nofollow">面试题 04.03. 特定深度节点链表</a></td> 
 <td>递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106802635" rel="nofollow">面试题 04.08. 首个共同祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109569811" rel="nofollow">面试题 04.10. 检查子树</a></td> 
 <td>递归</td> 
 <td>572. 另一个树的子树</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106278012" rel="nofollow">面试题 05.07. 配对交换</a></td> 
 <td>位运算</td> 
 <td>先找出奇数位，再找出偶数位，然后交换</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106146131" rel="nofollow">面试题 10.01. 合并排序的数组</a></td> 
 <td>双指针</td> 
 <td></td> 
 <td>易错</td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106257787" rel="nofollow">面试题15. 二进制中1的个数</a></td> 
 <td>二进制模拟，位运算</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106261848" rel="nofollow">面试题 16.01. 交换数字</a></td> 
 <td>异或、数学</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106277042" rel="nofollow">面试题 16.07. 最大数值</a></td> 
 <td>位操作</td> 
 <td>相减，取出符号位—&gt;数学运算</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109368307" rel="nofollow">面试题 17.12. BiNode</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105679990" rel="nofollow">面试题 17.04. 消失的数字</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/105680260" rel="nofollow">面试题 17.10. 主要元素</a></td> 
 <td>map、摩根投票法</td> 
 <td>[169. 多数元素]、、[1287. 有序数组中出现次数超过25%的元素]</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106078315" rel="nofollow">LCP 01. 猜数字</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106195645" rel="nofollow">剑指 Offer 18. 删除链表的节点</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106187331" rel="nofollow">面试题22. 链表中倒数第k个节点</a></td> 
 <td>双指针、递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106213162" rel="nofollow">面试题24 反转链表</a></td> 
 <td>头插法、双指针、递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106264028" rel="nofollow">面试题27. 二叉树 </a></td> 
 <td></td> 
 <td>226. 翻转二叉树的镜像</td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/110096695" rel="nofollow">剑指 Offer 32 - I. 从上到下打印二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106768220" rel="nofollow">面试题32 - II. 从上到下打印二叉树 II</a></td> 
 <td>队列，递归</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106780943" rel="nofollow">面试题54. 二叉搜索树的第k大节点</a></td> 
 <td>易错题</td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106757745" rel="nofollow">面试题55 - I. 二叉树的深度</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/109826256" rel="nofollow">剑指 Offer 07. 重建二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106799710" rel="nofollow">剑指 Offer 55 - II. 平衡二叉树</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106810001" rel="nofollow">面试题68 - I. 二叉搜索树的最近公共祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106802635" rel="nofollow">面试题68 - II. 二叉树的最近公共祖先</a></td> 
 <td></td> 
 <td></td> 
 <td></td> 
 </tr> 
 <tr> 
 <td><a href="https://blog.csdn.net/zhizhengguan/article/details/106423453" rel="nofollow">递归之求阶乘</a></td> 
 <td>递归</td> 
 <td></td> 
 <td>递归树入门</td> 
 </tr> 
 </tbody> 
</table>

# leetcode大神 #

[https://www.cnblogs.com/grandyang/p/4606334.html][https_www.cnblogs.com_grandyang_p_4606334.html]  
[https://github.com/gzwl/leetcode][https_github.com_gzwl_leetcode]  
[https://blog.csdn.net/lanxu\_yy/column/info/leetcode-solution][https_blog.csdn.net_lanxu_yy_column_info_leetcode-solution]  
[电子书下载][Link 22]

目标：在我职业生涯的前3年，至少把leetcode上的题刷完一半

刷题oj：[https://www.luogu.com.cn/problem/list?orderBy=difficulty&order=asc&difficulty=1&page=1][https_www.luogu.com.cn_problem_list_orderBy_difficulty_order_asc_difficulty_1_page_1]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poaXpoZW5nZ3Vhbg_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/3b5375582b5d48f49c9924fa98e20c58.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poaXpoZW5nZ3Vhbg==,size_16,color_FFFFFF,t_70
[Link 1]: http://tools.jb51.net/aideddesign/paixu_ys
[Link 2]: https://blog.csdn.net/zhizhengguan/article/details/104613636
[Link 3]: https://blog.csdn.net/zhizhengguan/article/details/95886799
[Link 4]: https://blog.csdn.net/zhizhengguan/article/details/95897884
[Link 5]: https://blog.csdn.net/zhizhengguan/article/details/103339608
[Link 6]: https://blog.csdn.net/zhizhengguan/article/details/104625921
[shell]: https://blog.csdn.net/zhizhengguan/article/details/104654305
[Link 7]: https://blog.csdn.net/zhizhengguan/article/details/104755681
[Link 8]: https://blog.csdn.net/zhizhengguan/article/details/104698957
[Link 9]: https://blog.csdn.net/zhizhengguan/article/details/105790497
[Link 10]: https://blog.csdn.net/zhizhengguan/article/details/106879225
[Link 11]: https://blog.csdn.net/zhizhengguan/article/details/106878458
[Link 12]: https://blog.csdn.net/zhizhengguan/article/details/106898527
[Link 13]: https://blog.csdn.net/zhizhengguan/article/details/106826270
[Link 14]: https://blog.csdn.net/zhizhengguan/article/details/106825914
[Link 15]: https://blog.csdn.net/zhizhengguan/article/details/106860757
[Link 16]: https://blog.csdn.net/zhizhengguan/article/details/106872575
[Link 17]: https://blog.csdn.net/zhizhengguan/article/details/106906563
[Link 18]: https://blog.csdn.net/zhizhengguan/article/details/106936953
[Link 19]: https://blog.csdn.net/zhizhengguan/article/details/104342818
[Link 20]: https://blog.csdn.net/zhizhengguan/article/details/107816510
[Link 21]: https://blog.csdn.net/zhizhengguan/article/details/106921237
[Java]: https://blog.csdn.net/zhizhengguan/article/details/104558541
[Java 1]: https://blog.csdn.net/zhizhengguan/article/details/105977087
[09.]: https://blog.csdn.net/zhizhengguan/article/details/106090985
[03.04.]: https://blog.csdn.net/zhizhengguan/article/details/106090597
[933.]: https://blog.csdn.net/zhizhengguan/article/details/106255867
[203.]: https://blog.csdn.net/zhizhengguan/article/details/106220045
[02.01.]: https://blog.csdn.net/zhizhengguan/article/details/106947034
[82. _ II]: https://blog.csdn.net/zhizhengguan/article/details/107139340
[83.]: https://blog.csdn.net/zhizhengguan/article/details/106195137
[141.]: https://blog.csdn.net/zhizhengguan/article/details/106236013
[876.]: https://blog.csdn.net/zhizhengguan/article/details/106189054
[Offer 22. _k_ _ 02.02_ k _]: https://blog.csdn.net/zhizhengguan/article/details/106187331
[02.07. _ Offer 52_160. _]: https://blog.csdn.net/zhizhengguan/article/details/106190997
[Offer 24_ _ 206 _]: https://blog.csdn.net/zhizhengguan/article/details/106213162
[234. _ 02.06 _]: https://blog.csdn.net/zhizhengguan/article/details/106216037
[21.]: https://blog.csdn.net/zhizhengguan/article/details/106146806
[https_www.cnblogs.com_grandyang_p_4606334.html]: https://www.cnblogs.com/grandyang/p/4606334.html
[https_github.com_gzwl_leetcode]: https://github.com/gzwl/leetcode
[https_blog.csdn.net_lanxu_yy_column_info_leetcode-solution]: https://blog.csdn.net/lanxu_yy/column/info/leetcode-solution
[Link 22]: https://tanqingbo.cn/CSBook001/
[https_www.luogu.com.cn_problem_list_orderBy_difficulty_order_asc_difficulty_1_page_1]: https://www.luogu.com.cn/problem/list?orderBy=difficulty&order=asc&difficulty=1&page=1