https://www.iam041.com/tags/leetcode/Recent content in LeetCode on 041 BlogHugozh_CNMon, 16 Mar 2026 14:30:00 +0800https://www.iam041.com/posts/leetcode-hot-100-solutions/Mon, 16 Mar 2026 14:30:00 +0800https://www.iam041.com/posts/leetcode-hot-100-solutions/<h2 id="索引">索引</h2> <ul> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%93%88%e5%b8%8c">哈希</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%8f%8c%e6%8c%87%e9%92%88">双指针</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e6%bb%91%e5%8a%a8%e7%aa%97%e5%8f%a3">滑动窗口</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%ad%90%e4%b8%b2">子串</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e6%99%ae%e9%80%9a%e6%95%b0%e7%bb%84">普通数组</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e7%9f%a9%e9%98%b5">矩阵</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e9%93%be%e8%a1%a8">链表</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e4%ba%8c%e5%8f%89%e6%a0%91">二叉树</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%9b%be%e8%ae%ba">图论</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%9b%9e%e6%ba%af%e6%b3%95">回溯法</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e4%ba%8c%e5%88%86%e6%9f%a5%e6%89%be">二分查找</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e6%a0%88">栈</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%a0%86">堆</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e8%b4%aa%e5%bf%83%e7%ae%97%e6%b3%95">贪心算法</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92">动态规划</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e5%a4%9a%e7%bb%b4%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92">多维动态规划</a></li> <li><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#%e6%8a%80%e5%b7%a7">技巧</a></li> </ul> <h2 id="哈希">哈希</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>1</td> <td><a href="https://leetcode.cn/problems/two-sum/">两数之和</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#1-%e4%b8%a4%e6%95%b0%e4%b9%8b%e5%92%8c">题解</a></td> </tr> <tr> <td>中等</td> <td>49</td> <td><a href="https://leetcode.cn/problems/group-anagrams/">字母异位词分组</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#49-%e5%ad%97%e6%af%8d%e5%bc%82%e4%bd%8d%e8%af%8d%e5%88%86%e7%bb%84">题解</a></td> </tr> <tr> <td>中等</td> <td>128</td> <td><a href="https://leetcode.cn/problems/longest-consecutive-sequence/">最长连续序列</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#128-%e6%9c%80%e9%95%bf%e8%bf%9e%e7%bb%ad%e5%ba%8f%e5%88%97">题解</a></td> </tr> </tbody> </table> <h2 id="双指针">双指针</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>283</td> <td><a href="https://leetcode.cn/problems/move-zeroes/">移动零</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#283-%e7%a7%bb%e5%8a%a8%e9%9b%b6">题解</a></td> </tr> <tr> <td>中等</td> <td>11</td> <td><a href="https://leetcode.cn/problems/container-with-most-water/">盛最多水的容器</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#11-%e7%9b%9b%e6%9c%80%e5%a4%9a%e6%b0%b4%e7%9a%84%e5%ae%b9%e5%99%a8">题解</a></td> </tr> <tr> <td>中等</td> <td>15</td> <td><a href="https://leetcode.cn/problems/3sum/">三数之和</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#15-%e4%b8%89%e6%95%b0%e4%b9%8b%e5%92%8c">题解</a></td> </tr> </tbody> </table> <h2 id="滑动窗口">滑动窗口</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>3</td> <td><a href="https://leetcode.cn/problems/longest-substring-without-repeating-characters/">无重复字符的最长子串</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#3-%e6%97%a0%e9%87%8d%e5%a4%8d%e5%ad%97%e7%ac%a6%e7%9a%84%e6%9c%80%e9%95%bf%e5%ad%90%e4%b8%b2">题解</a></td> </tr> <tr> <td>中等</td> <td>438</td> <td><a href="https://leetcode.cn/problems/find-all-anagrams-in-a-string/">找到字符串中所有字母异位词</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#438-%e6%89%be%e5%88%b0%e5%ad%97%e7%ac%a6%e4%b8%b2%e4%b8%ad%e6%89%80%e6%9c%89%e5%ad%97%e6%af%8d%e5%bc%82%e4%bd%8d%e8%af%8d">题解</a></td> </tr> </tbody> </table> <h2 id="子串">子串</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>560</td> <td><a href="https://leetcode.cn/problems/subarray-sum-equals-k/">和为 K 的子数组</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#560-%e5%92%8c%e4%b8%ba-k-%e7%9a%84%e5%ad%90%e6%95%b0%e7%bb%84">题解</a></td> </tr> </tbody> </table> <h2 id="普通数组">普通数组</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>53</td> <td><a href="https://leetcode.cn/problems/maximum-subarray/">最大子数组和</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#53-%e6%9c%80%e5%a4%a7%e5%ad%90%e6%95%b0%e7%bb%84%e5%92%8c">题解</a></td> </tr> <tr> <td>中等</td> <td>56</td> <td><a href="https://leetcode.cn/problems/merge-intervals/">合并区间</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#56-%e5%90%88%e5%b9%b6%e5%8c%ba%e9%97%b4">题解</a></td> </tr> <tr> <td>中等</td> <td>189</td> <td><a href="https://leetcode.cn/problems/rotate-array/">轮转数组</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#189-%e8%bd%ae%e8%bd%ac%e6%95%b0%e7%bb%84">题解</a></td> </tr> <tr> <td>中等</td> <td>238</td> <td><a href="https://leetcode.cn/problems/product-of-array-except-self/">除自身以外数组的乘积</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#238-%e9%99%a4%e8%87%aa%e8%ba%ab%e4%bb%a5%e5%a4%96%e6%95%b0%e7%bb%84%e7%9a%84%e4%b9%98%e7%a7%af">题解</a></td> </tr> </tbody> </table> <h2 id="矩阵">矩阵</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>73</td> <td><a href="https://leetcode.cn/problems/set-matrix-zeroes/">矩阵置零</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#73-%e7%9f%a9%e9%98%b5%e7%bd%ae%e9%9b%b6">题解</a></td> </tr> <tr> <td>中等</td> <td>54</td> <td><a href="https://leetcode.cn/problems/spiral-matrix/">螺旋矩阵</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#54-%e8%9e%ba%e6%97%8b%e7%9f%a9%e9%98%b5">题解</a></td> </tr> <tr> <td>中等</td> <td>48</td> <td><a href="https://leetcode.cn/problems/rotate-image/">旋转图像</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#48-%e6%97%8b%e8%bd%ac%e5%9b%be%e5%83%8f">题解</a></td> </tr> <tr> <td>中等</td> <td>240</td> <td><a href="https://leetcode.cn/problems/search-a-2d-matrix-ii/">搜索二维矩阵 II</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#240-%e6%90%9c%e7%b4%a2%e4%ba%8c%e7%bb%b4%e7%9f%a9%e9%98%b5-ii">题解</a></td> </tr> </tbody> </table> <h2 id="链表">链表</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>160</td> <td><a href="https://leetcode.cn/problems/intersection-of-two-linked-lists/">相交链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#160-%e7%9b%b8%e4%ba%a4%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>简单</td> <td>206</td> <td><a href="https://leetcode.cn/problems/reverse-linked-list/">反转链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#206-%e5%8f%8d%e8%bd%ac%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>简单</td> <td>234</td> <td><a href="https://leetcode.cn/problems/palindrome-linked-list/">回文链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#234-%e5%9b%9e%e6%96%87%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>简单</td> <td>141</td> <td><a href="https://leetcode.cn/problems/linked-list-cycle/">环形链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#141-%e7%8e%af%e5%bd%a2%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>简单</td> <td>21</td> <td><a href="https://leetcode.cn/problems/merge-two-sorted-lists/">合并两个有序链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#21-%e5%90%88%e5%b9%b6%e4%b8%a4%e4%b8%aa%e6%9c%89%e5%ba%8f%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>中等</td> <td>142</td> <td><a href="https://leetcode.cn/problems/linked-list-cycle-ii/">环形链表 II</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#142-%e7%8e%af%e5%bd%a2%e9%93%be%e8%a1%a8-ii">题解</a></td> </tr> <tr> <td>中等</td> <td>2</td> <td><a href="https://leetcode.cn/problems/add-two-numbers/">两数相加</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#2-%e4%b8%a4%e6%95%b0%e7%9b%b8%e5%8a%a0">题解</a></td> </tr> <tr> <td>中等</td> <td>19</td> <td><a href="https://leetcode.cn/problems/remove-nth-node-from-end-of-list/">删除链表的倒数第 N 个结点</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#19-%e5%88%a0%e9%99%a4%e9%93%be%e8%a1%a8%e7%9a%84%e5%80%92%e6%95%b0%e7%ac%ac-n-%e4%b8%aa%e7%bb%93%e7%82%b9">题解</a></td> </tr> <tr> <td>中等</td> <td>24</td> <td><a href="https://leetcode.cn/problems/swap-nodes-in-pairs/">两两交换链表中的节点</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#24-%e4%b8%a4%e4%b8%a4%e4%ba%a4%e6%8d%a2%e9%93%be%e8%a1%a8%e4%b8%ad%e7%9a%84%e8%8a%82%e7%82%b9">题解</a></td> </tr> <tr> <td>中等</td> <td>148</td> <td><a href="https://leetcode.cn/problems/sort-list/">排序链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#148-%e6%8e%92%e5%ba%8f%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>中等</td> <td>146</td> <td><a href="https://leetcode.cn/problems/lru-cache/">LRU 缓存</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#146-lru-%e7%bc%93%e5%ad%98">题解</a></td> </tr> <tr> <td>中等</td> <td>138</td> <td><a href="https://leetcode.cn/problems/copy-list-with-random-pointer/">随机链表的复制</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#138-%e9%9a%8f%e6%9c%ba%e9%93%be%e8%a1%a8%e7%9a%84%e5%a4%8d%e5%88%b6">题解</a></td> </tr> </tbody> </table> <h2 id="二叉树">二叉树</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>94</td> <td><a href="https://leetcode.cn/problems/binary-tree-inorder-traversal/">二叉树的中序遍历</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#94-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e4%b8%ad%e5%ba%8f%e9%81%8d%e5%8e%86">题解</a></td> </tr> <tr> <td>简单</td> <td>104</td> <td><a href="https://leetcode.cn/problems/maximum-depth-of-binary-tree/">二叉树的最大深度</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#104-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e6%9c%80%e5%a4%a7%e6%b7%b1%e5%ba%a6">题解</a></td> </tr> <tr> <td>简单</td> <td>226</td> <td><a href="https://leetcode.cn/problems/invert-binary-tree/">翻转二叉树</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#226-%e7%bf%bb%e8%bd%ac%e4%ba%8c%e5%8f%89%e6%a0%91">题解</a></td> </tr> <tr> <td>简单</td> <td>543</td> <td><a href="https://leetcode.cn/problems/diameter-of-binary-tree/">二叉树的直径</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#543-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e7%9b%b4%e5%be%84">题解</a></td> </tr> <tr> <td>简单</td> <td>108</td> <td><a href="https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/">将有序数组转换为二叉搜索树</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#108-%e5%b0%86%e6%9c%89%e5%ba%8f%e6%95%b0%e7%bb%84%e8%bd%ac%e6%8d%a2%e4%b8%ba%e4%ba%8c%e5%8f%89%e6%90%9c%e7%b4%a2%e6%a0%91">题解</a></td> </tr> <tr> <td>中等</td> <td>102</td> <td><a href="https://leetcode.cn/problems/binary-tree-level-order-traversal/">二叉树的层序遍历</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#102-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e5%b1%82%e5%ba%8f%e9%81%8d%e5%8e%86">题解</a></td> </tr> <tr> <td>中等</td> <td>98</td> <td><a href="https://leetcode.cn/problems/validate-binary-search-tree/">验证二叉搜索树</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#98-%e9%aa%8c%e8%af%81%e4%ba%8c%e5%8f%89%e6%90%9c%e7%b4%a2%e6%a0%91">题解</a></td> </tr> <tr> <td>中等</td> <td>230</td> <td><a href="https://leetcode.cn/problems/kth-smallest-element-in-a-bst/">二叉搜索树中第 K 小的元素</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#230-%e4%ba%8c%e5%8f%89%e6%90%9c%e7%b4%a2%e6%a0%91%e4%b8%ad%e7%ac%ac-k-%e5%b0%8f%e7%9a%84%e5%85%83%e7%b4%a0">题解</a></td> </tr> <tr> <td>中等</td> <td>199</td> <td><a href="https://leetcode.cn/problems/binary-tree-right-side-view/">二叉树的右视图</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#199-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e5%8f%b3%e8%a7%86%e5%9b%be">题解</a></td> </tr> <tr> <td>中等</td> <td>114</td> <td><a href="https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/">二叉树展开为链表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#114-%e4%ba%8c%e5%8f%89%e6%a0%91%e5%b1%95%e5%bc%80%e4%b8%ba%e9%93%be%e8%a1%a8">题解</a></td> </tr> <tr> <td>中等</td> <td>105</td> <td><a href="https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/">从前序与中序遍历序列构造二叉树</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#105-%e4%bb%8e%e5%89%8d%e5%ba%8f%e4%b8%8e%e4%b8%ad%e5%ba%8f%e9%81%8d%e5%8e%86%e5%ba%8f%e5%88%97%e6%9e%84%e9%80%a0%e4%ba%8c%e5%8f%89%e6%a0%91">题解</a></td> </tr> <tr> <td>中等</td> <td>437</td> <td><a href="https://leetcode.cn/problems/path-sum-iii/">路径总和 III</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#437-%e8%b7%af%e5%be%84%e6%80%bb%e5%92%8c-iii">题解</a></td> </tr> <tr> <td>中等</td> <td>236</td> <td><a href="https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/">二叉树的最近公共祖先</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#236-%e4%ba%8c%e5%8f%89%e6%a0%91%e7%9a%84%e6%9c%80%e8%bf%91%e5%85%ac%e5%85%b1%e7%a5%96%e5%85%88">题解</a></td> </tr> </tbody> </table> <h2 id="图论">图论</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>200</td> <td><a href="https://leetcode.cn/problems/number-of-islands/">岛屿数量</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#200-%e5%b2%9b%e5%b1%bf%e6%95%b0%e9%87%8f">题解</a></td> </tr> <tr> <td>中等</td> <td>994</td> <td><a href="https://leetcode.cn/problems/rotting-oranges/">腐烂的橘子</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#994-%e8%85%90%e7%83%82%e7%9a%84%e6%a9%98%e5%ad%90">题解</a></td> </tr> <tr> <td>中等</td> <td>207</td> <td><a href="https://leetcode.cn/problems/course-schedule/">课程表</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#207-%e8%af%be%e7%a8%8b%e8%a1%a8">题解</a></td> </tr> <tr> <td>中等</td> <td>208</td> <td><a href="https://leetcode.cn/problems/implement-trie-prefix-tree/">实现 Trie (前缀树)</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#208-%e5%ae%9e%e7%8e%b0-trie-%e5%89%8d%e7%bc%80%e6%a0%91">题解</a></td> </tr> </tbody> </table> <h2 id="回溯法">回溯法</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>46</td> <td><a href="https://leetcode.cn/problems/permutations/">全排列</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#46-%e5%85%a8%e6%8e%92%e5%88%97">题解</a></td> </tr> <tr> <td>中等</td> <td>78</td> <td><a href="https://leetcode.cn/problems/subsets/">子集</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#78-%e5%ad%90%e9%9b%86">题解</a></td> </tr> <tr> <td>中等</td> <td>17</td> <td><a href="https://leetcode.cn/problems/letter-combinations-of-a-phone-number/">电话号码的字母组合</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#17-%e7%94%b5%e8%af%9d%e5%8f%b7%e7%a0%81%e7%9a%84%e5%ad%97%e6%af%8d%e7%bb%84%e5%90%88">题解</a></td> </tr> <tr> <td>中等</td> <td>39</td> <td><a href="https://leetcode.cn/problems/combination-sum/">组合总和</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#39-%e7%bb%84%e5%90%88%e6%80%bb%e5%92%8c">题解</a></td> </tr> <tr> <td>中等</td> <td>22</td> <td><a href="https://leetcode.cn/problems/generate-parentheses/">括号生成</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#22-%e6%8b%ac%e5%8f%b7%e7%94%9f%e6%88%90">题解</a></td> </tr> <tr> <td>中等</td> <td>79</td> <td><a href="https://leetcode.cn/problems/word-search/">单词搜索</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#79-%e5%8d%95%e8%af%8d%e6%90%9c%e7%b4%a2">题解</a></td> </tr> <tr> <td>中等</td> <td>131</td> <td><a href="https://leetcode.cn/problems/palindrome-partitioning/">分割回文串</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#131-%e5%88%86%e5%89%b2%e5%9b%9e%e6%96%87%e4%b8%b2">题解</a></td> </tr> </tbody> </table> <h2 id="二分查找">二分查找</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>35</td> <td><a href="https://leetcode.cn/problems/search-insert-position/">搜索插入位置</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#35-%e6%90%9c%e7%b4%a2%e6%8f%92%e5%85%a5%e4%bd%8d%e7%bd%ae">题解</a></td> </tr> <tr> <td>中等</td> <td>74</td> <td><a href="https://leetcode.cn/problems/search-a-2d-matrix/">搜索二维矩阵</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#74-%e6%90%9c%e7%b4%a2%e4%ba%8c%e7%bb%b4%e7%9f%a9%e9%98%b5">题解</a></td> </tr> <tr> <td>中等</td> <td>34</td> <td><a href="https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/">在排序数组中查找元素的第一个和最后一个位置</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#34-%e5%9c%a8%e6%8e%92%e5%ba%8f%e6%95%b0%e7%bb%84%e4%b8%ad%e6%9f%a5%e6%89%be%e5%85%83%e7%b4%a0%e7%9a%84%e7%ac%ac%e4%b8%80%e4%b8%aa%e5%92%8c%e6%9c%80%e5%90%8e%e4%b8%80%e4%b8%aa%e4%bd%8d%e7%bd%ae">题解</a></td> </tr> <tr> <td>中等</td> <td>33</td> <td><a href="https://leetcode.cn/problems/search-in-rotated-sorted-array/">搜索旋转排序数组</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#33-%e6%90%9c%e7%b4%a2%e6%97%8b%e8%bd%ac%e6%8e%92%e5%ba%8f%e6%95%b0%e7%bb%84">题解</a></td> </tr> <tr> <td>中等</td> <td>153</td> <td><a href="https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/">寻找旋转排序数组中的最小值</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#153-%e5%af%bb%e6%89%be%e6%97%8b%e8%bd%ac%e6%8e%92%e5%ba%8f%e6%95%b0%e7%bb%84%e4%b8%ad%e7%9a%84%e6%9c%80%e5%b0%8f%e5%80%bc">题解</a></td> </tr> </tbody> </table> <h2 id="栈">栈</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>20</td> <td><a href="https://leetcode.cn/problems/valid-parentheses/">有效的括号</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#20-%e6%9c%89%e6%95%88%e7%9a%84%e6%8b%ac%e5%8f%b7">题解</a></td> </tr> <tr> <td>中等</td> <td>155</td> <td><a href="https://leetcode.cn/problems/min-stack/">最小栈</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#155-%e6%9c%80%e5%b0%8f%e6%a0%88">题解</a></td> </tr> <tr> <td>中等</td> <td>394</td> <td><a href="https://leetcode.cn/problems/decode-string/">字符串解码</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#394-%e5%ad%97%e7%ac%a6%e4%b8%b2%e8%a7%a3%e7%a0%81">题解</a></td> </tr> </tbody> </table> <h2 id="堆">堆</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>215</td> <td><a href="https://leetcode.cn/problems/kth-largest-element-in-an-array/">数组中的第K个最大元素</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#215-%e6%95%b0%e7%bb%84%e4%b8%ad%e7%9a%84%e7%ac%ack%e4%b8%aa%e6%9c%80%e5%a4%a7%e5%85%83%e7%b4%a0">题解</a></td> </tr> <tr> <td>中等</td> <td>347</td> <td><a href="https://leetcode.cn/problems/top-k-frequent-elements/">前 K 个高频元素</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#347-%e5%89%8d-k-%e4%b8%aa%e9%ab%98%e9%a2%91%e5%85%83%e7%b4%a0">题解</a></td> </tr> </tbody> </table> <h2 id="贪心算法">贪心算法</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>121</td> <td><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/">买卖股票的最佳时机</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#121-%e4%b9%b0%e5%8d%96%e8%82%a1%e7%a5%a8%e7%9a%84%e6%9c%80%e4%bd%b3%e6%97%b6%e6%9c%ba">题解</a></td> </tr> <tr> <td>中等</td> <td>55</td> <td><a href="https://leetcode.cn/problems/jump-game/">跳跃游戏</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#55-%e8%b7%b3%e8%b7%83%e6%b8%b8%e6%88%8f">题解</a></td> </tr> <tr> <td>中等</td> <td>45</td> <td><a href="https://leetcode.cn/problems/jump-game-ii/">跳跃游戏 II</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#45-%e8%b7%b3%e8%b7%83%e6%b8%b8%e6%88%8f-ii">题解</a></td> </tr> <tr> <td>中等</td> <td>763</td> <td><a href="https://leetcode.cn/problems/partition-labels/">划分字母区间</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#763-%e5%88%92%e5%88%86%e5%ad%97%e6%af%8d%e5%8c%ba%e9%97%b4">题解</a></td> </tr> </tbody> </table> <h2 id="动态规划">动态规划</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>70</td> <td><a href="https://leetcode.cn/problems/climbing-stairs/">爬楼梯</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#70-%e7%88%ac%e6%a5%bc%e6%a2%af">题解</a></td> </tr> <tr> <td>简单</td> <td>118</td> <td><a href="https://leetcode.cn/problems/pascals-triangle/">杨辉三角</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#118-%e6%9d%a8%e8%be%89%e4%b8%89%e8%a7%92">题解</a></td> </tr> <tr> <td>中等</td> <td>198</td> <td><a href="https://leetcode.cn/problems/house-robber/">打家劫舍</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#198-%e6%89%93%e5%ae%b6%e5%8a%ab%e8%88%8d">题解</a></td> </tr> <tr> <td>中等</td> <td>279</td> <td><a href="https://leetcode.cn/problems/perfect-squares/">完全平方数</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#279-%e5%ae%8c%e5%85%a8%e5%b9%b3%e6%96%b9%e6%95%b0">题解</a></td> </tr> <tr> <td>中等</td> <td>322</td> <td><a href="https://leetcode.cn/problems/coin-change/">零钱兑换</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#322-%e9%9b%b6%e9%92%b1%e5%85%91%e6%8d%a2">题解</a></td> </tr> <tr> <td>中等</td> <td>139</td> <td><a href="https://leetcode.cn/problems/word-break/">单词拆分</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#139-%e5%8d%95%e8%af%8d%e6%8b%86%e5%88%86">题解</a></td> </tr> <tr> <td>中等</td> <td>300</td> <td><a href="https://leetcode.cn/problems/longest-increasing-subsequence/">最长递增子序列</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#300-%e6%9c%80%e9%95%bf%e9%80%92%e5%a2%9e%e5%ad%90%e5%ba%8f%e5%88%97">题解</a></td> </tr> <tr> <td>中等</td> <td>152</td> <td><a href="https://leetcode.cn/problems/maximum-product-subarray/">乘积最大子数组</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#152-%e4%b9%98%e7%a7%af%e6%9c%80%e5%a4%a7%e5%ad%90%e6%95%b0%e7%bb%84">题解</a></td> </tr> <tr> <td>中等</td> <td>416</td> <td><a href="https://leetcode.cn/problems/partition-equal-subset-sum/">分割等和子集</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#416-%e5%88%86%e5%89%b2%e7%ad%89%e5%92%8c%e5%ad%90%e9%9b%86">题解</a></td> </tr> </tbody> </table> <h2 id="多维动态规划">多维动态规划</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>中等</td> <td>62</td> <td><a href="https://leetcode.cn/problems/unique-paths/">不同路径</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#62-%e4%b8%8d%e5%90%8c%e8%b7%af%e5%be%84">题解</a></td> </tr> <tr> <td>中等</td> <td>64</td> <td><a href="https://leetcode.cn/problems/minimum-path-sum/">最小路径和</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#64-%e6%9c%80%e5%b0%8f%e8%b7%af%e5%be%84%e5%92%8c">题解</a></td> </tr> <tr> <td>中等</td> <td>5</td> <td><a href="https://leetcode.cn/problems/longest-palindromic-substring/">最长回文子串</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#5-%e6%9c%80%e9%95%bf%e5%9b%9e%e6%96%87%e5%ad%90%e4%b8%b2">题解</a></td> </tr> <tr> <td>中等</td> <td>1143</td> <td><a href="https://leetcode.cn/problems/longest-common-subsequence/">最长公共子序列</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#1143-%e6%9c%80%e9%95%bf%e5%85%ac%e5%85%b1%e5%ad%90%e5%ba%8f%e5%88%97">题解</a></td> </tr> <tr> <td>中等</td> <td>72</td> <td><a href="https://leetcode.cn/problems/edit-distance/">编辑距离</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#72-%e7%bc%96%e8%be%91%e8%b7%9d%e7%a6%bb">题解</a></td> </tr> </tbody> </table> <h2 id="技巧">技巧</h2> <table> <thead> <tr> <th>难度</th> <th>题号</th> <th>题目</th> <th>题解</th> </tr> </thead> <tbody> <tr> <td>简单</td> <td>136</td> <td><a href="https://leetcode.cn/problems/single-number/">只出现一次的数字</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#136-%e5%8f%aa%e5%87%ba%e7%8e%b0%e4%b8%80%e6%ac%a1%e7%9a%84%e6%95%b0%e5%ad%97">题解</a></td> </tr> <tr> <td>简单</td> <td>169</td> <td><a href="https://leetcode.cn/problems/majority-element/">多数元素</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#169-%e5%a4%9a%e6%95%b0%e5%85%83%e7%b4%a0">题解</a></td> </tr> <tr> <td>中等</td> <td>75</td> <td><a href="https://leetcode.cn/problems/sort-colors/">颜色分类</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#75-%e9%a2%9c%e8%89%b2%e5%88%86%e7%b1%bb">题解</a></td> </tr> <tr> <td>中等</td> <td>31</td> <td><a href="https://leetcode.cn/problems/next-permutation/">下一个排列</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#31-%e4%b8%8b%e4%b8%80%e4%b8%aa%e6%8e%92%e5%88%97">题解</a></td> </tr> <tr> <td>中等</td> <td>287</td> <td><a href="https://leetcode.cn/problems/find-the-duplicate-number/">寻找重复数</a></td> <td><a href="https://www.iam041.com/posts/leetcode-hot-100-solutions/#287-%e5%af%bb%e6%89%be%e9%87%8d%e5%a4%8d%e6%95%b0">题解</a></td> </tr> </tbody> </table> <h2 id="哈希-1">哈希</h2> <h3 id="1-两数之和"><a href="https://leetcode.cn/problems/two-sum/description/?envType=study-plan-v2&amp;envId=top-100-liked">1. 两数之和</a></h3> <h4 id="题目描述">题目描述</h4> <p>给定一个整数数组<code>nums</code>和一个整数目标值<code>target</code>，请你在该数组中找出<strong>和为目标值</strong><code>target</code>的那<strong>两个</strong>整数，并返回它们的数组下标。 你可以假设每种输入只会对应一个答案，并且你不能使用两次相同的元素。 你可以按任意顺序返回答案。</p>