LeetCode 精选 TOP 面试题总结

谁践踏了优雅 2022-10-05 12:57 263阅读 0赞

### 文章目录 ###

*   *  前引
     *  题目博客链接
     *   *  Easy No.1-No.43
         *  Mid No.44-No.122
         *  Hard No.123-No.143

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

## 前引 ##

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

**因为在刷到贪心算法后面20-30通过率的中档题到  
困难题时 我明显的感觉到有些力不从心  
于是果断打算这段时间换一下口味  
转战到Leetcode LeetCode 精选 TOP 面试题栏里面  
故有此专栏博客总结**

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

## 题目博客链接 ##

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

### Easy No.1-No.43 ###

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

**[237. 删除链表中的节点][237.]**  
**[104. 二叉树的最大深度][104.]**  
**[344. 反转字符串 ][344. _]**  
**[108. 将有序数组转换为二叉搜索树][108.]**  
**[94. 二叉树的中序遍历][94.]**  
**[191. 位1的个数][191. _1]**  
**[206. 反转链表][206.]**  
**[136. 只出现一次的数字][136.]**  
**[118. 杨辉三角][118.]**  
**[171. Excel表列序号][171. Excel]**  
**[190. 颠倒二进制位][190.]**  
**[122. 买卖股票的最佳时机 II][122. _ II]**  
**[412. Fizz Buzz][]**  
**[21. 合并两个有序链表][21.]**  
**[242. 有效的字母异位词][242.]**  
**[169. 多数元素][169.]**  
**[13. 罗马数字转整数][13.]**  
**[202. 快乐数][202.]**  
**[160. 相交链表][160.]**  
**[121. 买卖股票的最佳时机][121.]**  
**[155. 最小栈][155.]**  
**[217. 存在重复元素][217.]**  
**[101. 对称二叉树][101.]**  
**[53. 最大子序和][53.]**  
**[350. 两个数组的交集 II][350. _ II]**  
**[26. 删除有序数组中的重复项][26.]**  
**[387. 字符串中的第一个唯一字符][387.]**  
**[70. 爬楼梯][70.]**  
**[1. 两数之和][1.]**  
**[88. 合并两个有序数组][88.]**  
**[141. 环形链表][141.]**  
**[234. 回文链表][234.]**  
**[326. 3的幂][326. 3]**  
**[125. 验证回文串][125.]**  
**[66. 加一][66.]**  
**[20. 有效的括号][20.]**  
**[172. 阶乘后的零][172.]**  
**[28. 实现 strStr()][28. _ strStr]**  
**[14. 最长公共前缀][14.]**  
**[69. x 的平方根][69. x]**  
**[204. 计数质数][204.]**  
**[7. 整数反转][7.]**  
**[163. 缺失的区间（需要会员没做）][163.]**

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

### Mid No.44-No.122 ###

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

**[78. 子集][78.]**  
**[46. 全排列][46.]**  
**[22. 括号生成][22.]**  
**[289. 生命游戏][289.]**  
**[230. 二叉搜索树中第K小的元素][230. _K]**  
**[48. 旋转图像][48.]**  
**[341. 扁平化嵌套列表迭代器][341.]**  
**[131. 分割回文串][131.]**  
**[238. 除自身以外数组的乘积][238.]**  
**[208. 实现 Trie (前缀树)][208. _ Trie]**  
**[105. 从前序与中序遍历序列构造二叉树][105.]**  
**[116. 填充每个节点的下一个右侧节点指针][116.]**  
**[236. 二叉树的最近公共祖先][236.]**  
**[148. 排序链表][148.]**  
**[49. 字母异位词分组][49.]**  
**[287. 寻找重复数][287.]**  
**[62. 不同路径][62.]**  
**[138. 复制带随机指针的链表][138.]**  
**[328. 奇偶链表][328.]**  
**[215. 数组中的第K个最大元素][215. _K]**  
**[102. 二叉树的层序遍历][102.]**  
**[378. 有序矩阵中第 K 小的元素][378. _ K]**  
**[285. 二叉搜索树中的中序后继（需要会员没做）][163.]**  
**[11. 盛最多水的容器][11.]**  
**[36. 有效的数独][36.]**  
**[347. 前 K 个高频元素][347. _ K]**  
**[73. 矩阵置零][73.]**  
**[348. 设计井字棋（需要会员没做）][163.]**  
**[454. 四数相加 II][454. _ II]**  
**[75. 颜色分类][75.]**  
**[38. 外观数列][38.]**  
**[371. 两整数之和][371.]**  
**[134. 加油站][134.]**  
**[384. 打乱数组][384.]**  
**[103. 二叉树的锯齿形层序遍历][103.]**  
**[277. 搜寻名人（需要会员没做）][163.]**  
**[17. 电话号码的字母组合][17.]**  
**[200. 岛屿数量][200.]**  
**[207. 课程表][207.]**  
**[128. 最长连续序列][128.]**  
**[251. 展开二维向量（需要会员没做）][163.]**  
**[210. 课程表 II][210. _ II]**  
**[150. 逆波兰表达式求值][150.]**  
**[146. LRU 缓存机制][146. LRU]**  
**[395. 至少有 K 个重复字符的最长子串][395. _ K]**  
**[139. 单词拆分][139.]**  
**[198. 打家劫舍][198.]**  
**[300. 最长递增子序列][300.]**  
**[380. O(1) 时间插入、删除和获取随机元素][380. O_1_]**  
**[253. 会议室 II（需要会员没做）][163.]**  
**[340. 至多包含 K 个不同字符（需要会员没做）][163.]**  
**[162. 寻找峰值][162.]**  
**[54. 螺旋矩阵][54.]**  
**[240. 搜索二维矩阵 II][240. _ II]**  
**[56. 合并区间][56.]**  
**[79. 单词搜索][79.]**  
**[189. 旋转数组][189.]**  
**[55. 跳跃游戏][55.]**  
**[19. 删除链表的倒数第 N 个结点][19. _ N]**  
**[33. 搜索旋转排序数组][33.]**  
**[34. 在排序数组中查找元素的第一个和最后一个位置][34.]**  
**[152. 乘积最大子数组][152.]**  
**[334. 递增的三元子序列][334.]**  
**[179. 最大数][179.]**  
**[2. 两数相加][2.]**  
**[3. 无重复字符的最长子串][3.]**  
**[324. 摆动排序 II][324. _ II]**  
**[50. Pow(x, n)][50. Pow_x_ n]**  
**[5. 最长回文子串][5.]**  
**[98. 验证二叉搜索树][98.]**  
**[15. 三数之和][15.]**  
**[91. 解码方法][91.]**  
**[166. 分数到小数（看到题目就不是很想做:( ）][166. _]**  
**[8. 字符串转换整数 (atoi)][8. _ _atoi]**  
**[29. 两数相除][29.]**

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

### Hard No.123-No.143 ###

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

**[42. 接雨水][42.]**  
**[23. 合并K个升序链表][23. _K]**  
**[297. 二叉树的序列化与反序列化][297.]**  
**[218. 天际线问题（待做）][163.]**  
**[295. 数据流的中位数（待做）][163.]**  
**[239. 滑动窗口最大值][239.]**  
**[140. 单词拆分 II][140. _ II]**  
**[329. 矩阵中的最长递增路径][329.]**  
**[127. 单词接龙][127.]**  
**[124. 二叉树中的最大路径和][124.]**  
**[84. 柱状图中最大的矩形][84.]**  
**[41. 缺失的第一个正数][41.]**  
**[315. 计算右侧小于当前元素的个数(待做)][163.]**  
**[4. 寻找两个正序数组的中位数][4.]**  
**[149. 直线上最多的点数][149.]**

[237.]: https://love6.blog.csdn.net/article/details/117732910
[104.]: https://love6.blog.csdn.net/article/details/111419437
[344. _]: https://love6.blog.csdn.net/article/details/117733296
[108.]: https://love6.blog.csdn.net/article/details/111423203
[94.]: https://love6.blog.csdn.net/article/details/111636271
[191. _1]: https://love6.blog.csdn.net/article/details/117804593
[206.]: https://love6.blog.csdn.net/article/details/115619144
[136.]: https://love6.blog.csdn.net/article/details/115620368
[118.]: https://love6.blog.csdn.net/article/details/117805669
[171. Excel]: https://love6.blog.csdn.net/article/details/117806537
[190.]: https://love6.blog.csdn.net/article/details/119079438
[122. _ II]: https://love6.blog.csdn.net/article/details/115578475
[412. Fizz Buzz]: https://love6.blog.csdn.net/article/details/119080145
[21.]: https://love6.blog.csdn.net/article/details/115622631
[242.]: https://love6.blog.csdn.net/article/details/119080405
[169.]: https://love6.blog.csdn.net/article/details/115621166
[13.]: https://love6.blog.csdn.net/article/details/119103769
[202.]: https://love6.blog.csdn.net/article/details/119104716
[160.]: https://love6.blog.csdn.net/article/details/115655462
[121.]: https://love6.blog.csdn.net/article/details/112802631
[155.]: https://blog.csdn.net/qq_37500516/article/details/115665051
[217.]: https://love6.blog.csdn.net/article/details/119134004
[101.]: https://love6.blog.csdn.net/article/details/111519015
[53.]: https://love6.blog.csdn.net/article/details/115665772
[350. _ II]: https://love6.blog.csdn.net/article/details/119135731
[26.]: https://love6.blog.csdn.net/article/details/119136345
[387.]: https://love6.blog.csdn.net/article/details/119169879
[70.]: https://love6.blog.csdn.net/article/details/112829928
[1.]: https://love6.blog.csdn.net/article/details/115682857
[88.]: https://love6.blog.csdn.net/article/details/119172679
[141.]: https://love6.blog.csdn.net/article/details/115682172
[234.]: https://love6.blog.csdn.net/article/details/115689783
[326. 3]: https://love6.blog.csdn.net/article/details/119206217
[125.]: https://love6.blog.csdn.net/article/details/119206561
[66.]: https://love6.blog.csdn.net/article/details/119207316
[20.]: https://love6.blog.csdn.net/article/details/115691867
[172.]: https://love6.blog.csdn.net/article/details/119209250
[28. _ strStr]: https://love6.blog.csdn.net/article/details/119253667
[14.]: https://love6.blog.csdn.net/article/details/119253942
[69. x]: https://love6.blog.csdn.net/article/details/119254162
[204.]: https://love6.blog.csdn.net/article/details/119254426
[7.]: https://love6.blog.csdn.net/article/details/119254608
[163.]: https:
[78.]: https://blog.csdn.net/qq_37500516/article/details/115692719
[46.]: https://love6.blog.csdn.net/article/details/115696530
[22.]: https://love6.blog.csdn.net/article/details/115697842
[289.]: https://love6.blog.csdn.net/article/details/119271804
[230. _K]: https://love6.blog.csdn.net/article/details/111686811
[48.]: https://love6.blog.csdn.net/article/details/115714819
[341.]: https://love6.blog.csdn.net/article/details/119299152
[131.]: https://love6.blog.csdn.net/article/details/116484930
[238.]: https://love6.blog.csdn.net/article/details/115716137
[208. _ Trie]: https://love6.blog.csdn.net/article/details/115722752
[105.]: https://love6.blog.csdn.net/article/details/115728881
[116.]: https://love6.blog.csdn.net/article/details/111403125
[236.]: https://love6.blog.csdn.net/article/details/111773525
[148.]: https://love6.blog.csdn.net/article/details/115736930
[49.]: https://love6.blog.csdn.net/article/details/115749885
[287.]: https://love6.blog.csdn.net/article/details/115741305
[62.]: https://love6.blog.csdn.net/article/details/113174388
[138.]: https://love6.blog.csdn.net/article/details/119817510
[328.]: https://love6.blog.csdn.net/article/details/119818197
[215. _K]: https://love6.blog.csdn.net/article/details/115753552
[102.]: https://love6.blog.csdn.net/article/details/115773960
[378. _ K]: https://love6.blog.csdn.net/article/details/119838604
[11.]: https://love6.blog.csdn.net/article/details/115755047
[36.]: https://love6.blog.csdn.net/article/details/119850596
[347. _ K]: https://blog.csdn.net/qq_37500516/article/details/115790129
[73.]: https://love6.blog.csdn.net/article/details/119860807
[454. _ II]: https://love6.blog.csdn.net/article/details/119861121
[75.]: https://love6.blog.csdn.net/article/details/115873274
[38.]: https://love6.blog.csdn.net/article/details/119881470
[371.]: https://love6.blog.csdn.net/article/details/119881570
[134.]: https://love6.blog.csdn.net/article/details/117189633
[384.]: https://love6.blog.csdn.net/article/details/119908905
[103.]: https://love6.blog.csdn.net/article/details/119909524
[17.]: https://love6.blog.csdn.net/article/details/115875361
[200.]: https://love6.blog.csdn.net/article/details/115957065
[207.]: https://love6.blog.csdn.net/article/details/115937524
[128.]: https://love6.blog.csdn.net/article/details/116237191
[210. _ II]: https://love6.blog.csdn.net/article/details/115819286
[150.]: https://love6.blog.csdn.net/article/details/119945301
[146. LRU]: https://love6.blog.csdn.net/article/details/115975337
[395. _ K]: https://love6.blog.csdn.net/article/details/119966995
[139.]: https://love6.blog.csdn.net/article/details/113719526
[198.]: https://love6.blog.csdn.net/article/details/113737319
[300.]: https://love6.blog.csdn.net/article/details/113753809
[380. O_1_]: https://love6.blog.csdn.net/article/details/119979627
[162.]: https://love6.blog.csdn.net/article/details/119991779
[54.]: https://love6.blog.csdn.net/article/details/119992795
[240. _ II]: https://love6.blog.csdn.net/article/details/116066784
[56.]: https://love6.blog.csdn.net/article/details/116069056
[79.]: https://love6.blog.csdn.net/article/details/116069814
[189.]: https://love6.blog.csdn.net/article/details/120018157
[55.]: https://love6.blog.csdn.net/article/details/116117337
[19. _ N]: https://love6.blog.csdn.net/article/details/116120005
[33.]: https://love6.blog.csdn.net/article/details/116121495
[34.]: https://love6.blog.csdn.net/article/details/116116926
[152.]: https://love6.blog.csdn.net/article/details/113833152
[334.]: https://love6.blog.csdn.net/article/details/120112383
[179.]: https://love6.blog.csdn.net/article/details/120113758
[2.]: https://love6.blog.csdn.net/article/details/116146884
[3.]: https://love6.blog.csdn.net/article/details/116151080
[324. _ II]: https://love6.blog.csdn.net/article/details/120130954
[50. Pow_x_ n]: https://love6.blog.csdn.net/article/details/120144903
[5.]: https://blog.csdn.net/qq_37500516/article/details/114068050
[98.]: https://love6.blog.csdn.net/article/details/116192042
[15.]: https://love6.blog.csdn.net/article/details/116197907
[91.]: https://love6.blog.csdn.net/article/details/114170699
[166. _]: https://leetcode-cn.com/problems/fraction-to-recurring-decimal/
[8. _ _atoi]: https://love6.blog.csdn.net/article/details/120174951
[29.]: https://love6.blog.csdn.net/article/details/120194282
[42.]: https://love6.blog.csdn.net/article/details/114652137
[23. _K]: https://love6.blog.csdn.net/article/details/116234089
[297.]: https://love6.blog.csdn.net/article/details/112452218
[239.]: https://love6.blog.csdn.net/article/details/116266242
[140. _ II]: https://love6.blog.csdn.net/article/details/115263040
[329.]: https://love6.blog.csdn.net/article/details/120259780
[127.]: https://love6.blog.csdn.net/article/details/120261494
[124.]: https://blog.csdn.net/qq_37500516/article/details/116266547
[84.]: https://love6.blog.csdn.net/article/details/116376371
[41.]: https://love6.blog.csdn.net/article/details/120305751
[4.]: https://love6.blog.csdn.net/article/details/116398899
[149.]: https://love6.blog.csdn.net/article/details/120321737