Leetcode题目汇总

秒速五厘米 2022-09-13 15:27 218阅读 0赞

> **文章最前**： 我是Octopus，这个名字来源于我的中文名--章鱼；我热爱编程、热爱算法、热爱开源。所有源码在我的个人[github][] ；这博客是记录我学习的点点滴滴，如果您对 Python、Java、AI、算法有兴趣，可以关注我的动态，一起学习，共同进步。

**题目目录**

1） Array题型

2）List类型

3）String类型

4）HashTable类型

5）Math类型

6）Tree类型

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

### **1） Array题型** ###

*  [733.Flood Fill(对二维数组进行转换)][733.Flood Fill]
 *  [240.Search2D(查找数字)][240.Search2D]
 *  [57. Insert Interval (向一个区间中插入一个区间）][57. Insert Interval]
 *  [42. Trapping Rain Water（能装多少水问题）][42. Trapping Rain Water]
 *  [84. Largest Rectangle in Histogram（面积最大的长方形）][84. Largest Rectangle in Histogram]
 *  [152. Maximum Product Subarray（最大的乘积数组）][152. Maximum Product Subarray]
 *  [85. Maximal Rectangle（最大的矩形）][85. Maximal Rectangle]
 *  [322. Coin Change（硬币兑换问题）][322. Coin Change]
 *  [621. Task Scheduler（任务规划问题）][621. Task Scheduler]
 *  [221. Maximal Square（数组中最大的正方形）][221. Maximal Square]
 *  [279. Perfect Squares（完美的平方）][279. Perfect Squares]
 *  [62. Unique Paths(一个点到另一个点的所有路径)][62. Unique Paths]
 *  [11. Container With Most Water（求能装多少水问题）][11. Container With Most Water]
 *  [287. Find the Duplicate Number（找出重复的数）][287. Find the Duplicate Number]
 *  [128. Longest Consecutive Sequence（找出最大的连续子串）][128. Longest Consecutive Sequence]
 *  [215. Kth Largest Element in an Array（输出第k大的数）][215. Kth Largest Element in an Array_k]
 *  [55. Jump Game（跳远比赛）][55. Jump Game]
 *  [300. Longest Increasing Subsequence（最大增长序列）][300. Longest Increasing Subsequence]
 *  [64. Minimum Path Sum（最小路径问题）][64. Minimum Path Sum]
 *  [56. Merge Intervals（合并区间）][56. Merge Intervals]
 *  [72. Edit Distance(编辑的最小步数)][72. Edit Distance]
 *  [39. Combination Sum（组合值等于某个固定值）][39. Combination Sum]
 *  [200. Number of Islands（查找岛屿的个数）][200. Number of Islands]
 *  [560. Subarray Sum Equals K（找出数组中连续子串和等于k）][560. Subarray Sum Equals K_k]
 *  [406. Queue Reconstruction by Height(对人进行排序)][406. Queue Reconstruction by Height]
 *  [416. Partition Equal Subset Sum(判断一个数组可以平均分为两半)][416. Partition Equal Subset Sum]
 *  [4. Median of Two Sorted Arrays(找出两个有序数组的中间数)][4. Median of Two Sorted Arrays]
 *  [121. Best Time to Buy and Sell Stock (找出股票的最大收益)][121. Best Time to Buy and Sell Stock]
 *  [581. Shortest Unsorted Continuous Subarray（找出数组中不需要排序的最小数组）][581. Shortest Unsorted Continuous Subarray]
 *  [70. Climbing Stairs(爬楼梯问题)][70. Climbing Stairs]
 *  [437. Path Sum III（查找最大值）][437. Path Sum III]
 *  [198. House Robber（房子抢劫问题）][198. House Robber]
 *  [2. Add Two Numbers（计算两个数的和）][2. Add Two Numbers]
 *  [15. Three Sum（三个数相加问题）][15. Three Sum]
 *  [448. Find All Numbers Disappeared in an Array (找出一个数组中没有出现的数)][448. Find All Numbers Disappeared in an Array]
 *  [283. Move Zeroes(把0移动到数组的后面)][283. Move Zeroes_0]
 *  [169. Majority Element(找出大多数元素)][169. Majority Element]
 *  [494. Target Sum（计算目标数）][494. Target Sum]
 *  [349.Intersection of Two Arrays(求两个数组的交集且不重合)][349.Intersection of Two Arrays]
 *  [350,Intersection of Two Arrays II(数组的的相交)][350_Intersection of Two Arrays II]
 *  [136.Single Number（找出单个数字）][136.Single Number]
 *  [7.Reverse Integer(反转一个数字)][7.Reverse Integer]
 *  [Top K Frequent Elements(找出出现频率最高的K个数)][Top K Frequent Elements_K]
 *  [35. Search Insert Position(数字插入合适的位置)][35. Search Insert Position]
 *  [268. Missing Number（遗失的数字）][268. Missing Number]
 *  [521. Longest Uncommon Subsequence I(找出特殊的子字符串)][521. Longest Uncommon Subsequence I]
 *  [217. Contains Duplicate（数组中是否有重复的数）][217. Contains Duplicate]
 *  [728. Self Dividing Numbers(找出范围内自除数）][728. Self Dividing Numbers]
 *  [122.Best Time Buy(最好时间购买股票)][122.Best Time Buy]
 *  [1217.Play With Chips(玩筹码)][1217.Play With Chips]
 *  [26. Remove Duplicates from Sorted Array(去除数组中重复的数)][26. Remove Duplicates from Sorted Array]
 *  [53. Maximum Subarray（找出数组中和最大子数组）][53. Maximum Subarray]

### **2）List类型** ###

*  **[114. Flatten Binary Tree to Linked List（固定二叉树为链表）][114. Flatten Binary Tree to Linked List]**
 *  [23. Merge k Sorted Lists（K个链表进行排序）][23. Merge k Sorted Lists_K]
 *  [142. Linked List Cycle II（找出链表中的环）][142. Linked List Cycle II]
 *  [160. Intersection of Two Linked Lists(找出两个链表的交点)][160. Intersection of Two Linked Lists]
 *  [234. Palindrome Linked List（判断一个链表是不是回文链表）][234. Palindrome Linked List]
 *  [155. Min Stack（找出栈中最小的那个值）][155. Min Stack]
 *  [148. Sort List（对链表进行排序）][148. Sort List]
 *  [21. Merge Two Sorted Lists（合并两个有序链表）][21. Merge Two Sorted Lists]
 *  [206. Reverse Linked List(单链表进行反转)][206. Reverse Linked List]
 *  [141. Linked List Cycle（判断链表中是否有环）][141. Linked List Cycle]
 *  [19. Remove Nth Node From End of List（删除链表中倒数第K个节点）][19. Remove Nth Node From End of List_K]

### 3）String类型 ###

*  [32. Longest Valid Parentheses(最长的有效匹配串)][32. Longest Valid Parentheses]
 *  [22. Generate Parentheses（生成匹配括号）][22. Generate Parentheses]
 *  [49. Group Anagrams（相同字符子串问题）][49. Group Anagrams]
 *  [139. Word Break(单词划分)][139. Word Break]
 *  [5. Longest Palindromic Substring（找出一个字符串中最大的子回文串）][5. Longest Palindromic Substring]
 *  [394. Decode String（解析字符串）][394. Decode String]
 *  [3. Longest Substring Without Repeating Characters（找出最长子串没有重复字符）][3. Longest Substring Without Repeating Characters]
 *  [917. Reverse Only Letters(仅仅反转字符)][917. Reverse Only Letters]
 *  [520.Detect Capital（检测大小写字母）][520.Detect Capital]
 *  [541.Reverse String II（按照要求反转字符串）][541.Reverse String II]
 *  [66. Plus One(数组数字加1)][66. Plus One_1]
 *  [Palindromic Substrings(找出字符串中所有的回文子串)][Palindromic Substrings]
 *  [438. Find All Anagrams in a String（找出相同的子串的下标）][438. Find All Anagrams in a String]
 *  [67. Add Binary(二进制相加)][67. Add Binary]

### 4）HashTable类型 ###

*  [1. Two Sum(一个数组中两个数的和)][1. Two Sum]
 *  [3： Longest Substring Without Repeating Characters(最长无重复字符串)][3_ Longest Substring Without Repeating Characters]
 *  [48. Rotate Image(旋转图片)][48. Rotate Image]
 *  [461. Hamming Distance(汉明距离)][461. Hamming Distance]
 *  [771. Jewels and Stones（计算宝石的数量）][771. Jewels and Stones]
 *  [167. Two Sum II - Input array is sorted(顺序数组中两个数的和)][167. Two Sum II - Input array is sorted]

### 5）Math类型 ###

*  [258.Add Digits (数字相加)][258.Add Digits]
 *  [1154.Day Of Year(日期为一年中多少天)][1154.Day Of Year]

### 6）Tree类型 ###

*  [94.Binary Tree Inorder Traversal（二叉树中序遍历）][94.Binary Tree Inorder Traversal]
 *  [144.Binary Tree PreOrder Traversal（二叉树前序遍历）][144.Binary Tree PreOrder Traversal]
 *  [145.Binary Tree Post Order Traversal（二叉树后序遍历）][145.Binary Tree Post Order Traversal]
 *  [236. Lowest Common Ancestor of a Binary Tree（二叉树中最小祖先）][236. Lowest Common Ancestor of a Binary Tree]
 *  [337. House Robber III（偷窃问题）][337. House Robber III]
 *  [102. Binary Tree Level Order Traversal（二叉树的层次遍历）][102. Binary Tree Level Order Traversal]
 *  [94. Binary Tree Inorder Traversal（中序遍历二叉树）][94. Binary Tree Inorder Traversal]
 *  [538. Convert BST to Greater Tree（一棵树上加入所有的节点）][538. Convert BST to Greater Tree]
 *  [572. Subtree of Another Tree（判断一棵树是不是另外一棵树的子树）][572. Subtree of Another Tree]
 *  [543. Diameter of Binary Tree(找出二叉树中最大的直径)][543. Diameter of Binary Tree]
 *  [101. Symmetric Tree（判断该树是不是对称树）][101. Symmetric Tree]
 *  [226. Invert Binary Tree（倒转一棵二叉树）][226. Invert Binary Tree]
 *  [104. Maximum Depth of Binary Tree（查找二叉树的最大深度）][104. Maximum Depth of Binary Tree]
 *  [617. Merge Two Binary Trees(合并两棵二叉树)][617. Merge Two Binary Trees]
 *  [606. Construct String from Binary Tree(构建一棵二叉树)][606. Construct String from Binary Tree]

[github]: https://github.com/zhangyu345293721
[733.Flood Fill]: https://blog.csdn.net/zy345293721/article/details/104135666
[240.Search2D]: https://blog.csdn.net/zy345293721/article/details/104163813
[57. Insert Interval]: https://blog.csdn.net/zy345293721/article/details/112842309
[42. Trapping Rain Water]: https://blog.csdn.net/zy345293721/article/details/85164977
[84. Largest Rectangle in Histogram]: https://blog.csdn.net/zy345293721/article/details/85253780
[152. Maximum Product Subarray]: https://blog.csdn.net/zy345293721/article/details/85235720
[85. Maximal Rectangle]: https://blog.csdn.net/zy345293721/article/details/85229189
[322. Coin Change]: https://blog.csdn.net/zy345293721/article/details/85223632
[621. Task Scheduler]: https://blog.csdn.net/zy345293721/article/details/85221280
[221. Maximal Square]: https://blog.csdn.net/zy345293721/article/details/85161333
[279. Perfect Squares]: https://blog.csdn.net/zy345293721/article/details/85159912
[62. Unique Paths]: https://blog.csdn.net/zy345293721/article/details/85019853
[11. Container With Most Water]: https://blog.csdn.net/zy345293721/article/details/85018708
[287. Find the Duplicate Number]: https://blog.csdn.net/zy345293721/article/details/85015366
[128. Longest Consecutive Sequence]: https://blog.csdn.net/zy345293721/article/details/85006310
[215. Kth Largest Element in an Array_k]: https://blog.csdn.net/zy345293721/article/details/84993730
[55. Jump Game]: https://blog.csdn.net/zy345293721/article/details/84991870
[300. Longest Increasing Subsequence]: https://blog.csdn.net/zy345293721/article/details/84984249
[64. Minimum Path Sum]: https://blog.csdn.net/zy345293721/article/details/84979265
[56. Merge Intervals]: https://blog.csdn.net/zy345293721/article/details/84978045
[72. Edit Distance]: https://blog.csdn.net/zy345293721/article/details/84976445
[39. Combination Sum]: https://blog.csdn.net/zy345293721/article/details/84960687
[200. Number of Islands]: https://blog.csdn.net/zy345293721/article/details/84960329
[560. Subarray Sum Equals K_k]: https://blog.csdn.net/zy345293721/article/details/84952201
[406. Queue Reconstruction by Height]: https://blog.csdn.net/zy345293721/article/details/84941352
[416. Partition Equal Subset Sum]: https://blog.csdn.net/zy345293721/article/details/84936435
[4. Median of Two Sorted Arrays]: https://blog.csdn.net/zy345293721/article/details/84875908
[121. Best Time to Buy and Sell Stock]: https://blog.csdn.net/zy345293721/article/details/84857583
[581. Shortest Unsorted Continuous Subarray]: https://blog.csdn.net/zy345293721/article/details/84855501
[70. Climbing Stairs]: https://blog.csdn.net/zy345293721/article/details/84839426
[437. Path Sum III]: https://blog.csdn.net/zy345293721/article/details/84837693
[198. House Robber]: https://blog.csdn.net/zy345293721/article/details/84836482
[2. Add Two Numbers]: https://blog.csdn.net/zy345293721/article/details/84784785
[15. Three Sum]: https://blog.csdn.net/zy345293721/article/details/84784251
[448. Find All Numbers Disappeared in an Array]: https://blog.csdn.net/zy345293721/article/details/84728191
[283. Move Zeroes_0]: https://blog.csdn.net/zy345293721/article/details/84726668
[169. Majority Element]: https://blog.csdn.net/zy345293721/article/details/84715556
[494. Target Sum]: https://blog.csdn.net/zy345293721/article/details/84643519
[349.Intersection of Two Arrays]: https://blog.csdn.net/zy345293721/article/details/83096060
[350_Intersection of Two Arrays II]: https://blog.csdn.net/zy345293721/article/details/83069550
[136.Single Number]: https://blog.csdn.net/zy345293721/article/details/83185189
[7.Reverse Integer]: https://blog.csdn.net/zy345293721/article/details/83182653
[Top K Frequent Elements_K]: https://blog.csdn.net/zy345293721/article/details/84310615
[35. Search Insert Position]: https://blog.csdn.net/zy345293721/article/details/84299628
[268. Missing Number]: https://blog.csdn.net/zy345293721/article/details/83933311
[521. Longest Uncommon Subsequence I]: https://blog.csdn.net/zy345293721/article/details/83744906
[217. Contains Duplicate]: https://blog.csdn.net/zy345293721/article/details/103976728
[728. Self Dividing Numbers]: https://blog.csdn.net/zy345293721/article/details/103983703
[122.Best Time Buy]: https://blog.csdn.net/zy345293721/article/details/104198493
[1217.Play With Chips]: https://blog.csdn.net/zy345293721/article/details/104282307
[26. Remove Duplicates from Sorted Array]: https://blog.csdn.net/zy345293721/article/details/84562766
[53. Maximum Subarray]: https://blog.csdn.net/zy345293721/article/details/84848699
[114. Flatten Binary Tree to Linked List]: https://blog.csdn.net/zy345293721/article/details/85163338
[23. Merge k Sorted Lists_K]: https://blog.csdn.net/zy345293721/article/details/84994970
[142. Linked List Cycle II]: https://blog.csdn.net/zy345293721/article/details/84961106
[160. Intersection of Two Linked Lists]: https://blog.csdn.net/zy345293721/article/details/84850298
[234. Palindrome Linked List]: https://blog.csdn.net/zy345293721/article/details/84849622
[155. Min Stack]: https://blog.csdn.net/zy345293721/article/details/84852978
[148. Sort List]: https://blog.csdn.net/zy345293721/article/details/84846681
[21. Merge Two Sorted Lists]: https://blog.csdn.net/zy345293721/article/details/84791423
[206. Reverse Linked List]: https://blog.csdn.net/zy345293721/article/details/84032331
[141. Linked List Cycle]: https://blog.csdn.net/zy345293721/article/details/84031623
[19. Remove Nth Node From End of List_K]: https://blog.csdn.net/zy345293721/article/details/82984093
[32. Longest Valid Parentheses]: https://blog.csdn.net/zy345293721/article/details/85055216
[22. Generate Parentheses]: https://blog.csdn.net/zy345293721/article/details/85014549
[49. Group Anagrams]: https://blog.csdn.net/zy345293721/article/details/85013887
[139. Word Break]: https://blog.csdn.net/zy345293721/article/details/84988686
[5. Longest Palindromic Substring]: https://blog.csdn.net/zy345293721/article/details/84870880
[394. Decode String]: https://blog.csdn.net/zy345293721/article/details/84957568
[3. Longest Substring Without Repeating Characters]: https://blog.csdn.net/zy345293721/article/details/84786170
[917. Reverse Only Letters]: https://blog.csdn.net/zy345293721/article/details/83743873
[520.Detect Capital]: https://blog.csdn.net/zy345293721/article/details/83059879
[541.Reverse String II]: https://blog.csdn.net/zy345293721/article/details/83048617
[66. Plus One_1]: https://blog.csdn.net/zy345293721/article/details/84542375
[Palindromic Substrings]: https://blog.csdn.net/zy345293721/article/details/84843605
[438. Find All Anagrams in a String]: https://blog.csdn.net/zy345293721/article/details/84842726
[67. Add Binary]: https://blog.csdn.net/zy345293721/article/details/104173291
[1. Two Sum]: https://blog.csdn.net/zy345293721/article/details/83023107
[3_ Longest Substring Without Repeating Characters]: https://blog.csdn.net/zy345293721/article/details/81868702
[48. Rotate Image]: https://blog.csdn.net/zy345293721/article/details/84985595
[461. Hamming Distance]: https://blog.csdn.net/zy345293721/article/details/84614747
[771. Jewels and Stones]: https://blog.csdn.net/zy345293721/article/details/84567745
[167. Two Sum II - Input array is sorted]: https://blog.csdn.net/zy345293721/article/details/84561249
[258.Add Digits]: https://blog.csdn.net/zy345293721/article/details/104189181
[1154.Day Of Year]: https://blog.csdn.net/zy345293721/article/details/104271703
[94.Binary Tree Inorder Traversal]: https://blog.csdn.net/zy345293721/article/details/106929330
[144.Binary Tree PreOrder Traversal]: https://blog.csdn.net/zy345293721/article/details/108887475
[145.Binary Tree Post Order Traversal]: https://blog.csdn.net/zy345293721/article/details/108884911
[236. Lowest Common Ancestor of a Binary Tree]: https://blog.csdn.net/zy345293721/article/details/85164131
[337. House Robber III]: https://blog.csdn.net/zy345293721/article/details/85050118
[102. Binary Tree Level Order Traversal]: https://blog.csdn.net/zy345293721/article/details/85049161
[94. Binary Tree Inorder Traversal]: https://blog.csdn.net/zy345293721/article/details/85046785
[538. Convert BST to Greater Tree]: https://blog.csdn.net/zy345293721/article/details/84863120
[572. Subtree of Another Tree]: https://blog.csdn.net/zy345293721/article/details/84861633
[543. Diameter of Binary Tree]: https://blog.csdn.net/zy345293721/article/details/84861015
[101. Symmetric Tree]: https://blog.csdn.net/zy345293721/article/details/84859674
[226. Invert Binary Tree]: https://blog.csdn.net/zy345293721/article/details/84653895
[104. Maximum Depth of Binary Tree]: https://blog.csdn.net/zy345293721/article/details/84635662
[617. Merge Two Binary Trees]: https://blog.csdn.net/zy345293721/article/details/84633192
[606. Construct String from Binary Tree]: https://blog.csdn.net/zy345293721/article/details/84304381