【LeetCode】题解合集（JavaScript版）

刺骨的言语ヽ痛彻心扉 2022-12-06 05:43 135阅读 0赞

**前言：**

今年断断续续写了些LeetCode题目，一方面是为了一个比较现实的问题——面试，最重要的是要复习之前学习的数据结构与算法。后面有时间还会接续刷题…

**题解合集：**

<table> 
 <thead> 
  <tr> 
   <th>题号</th> 
   <th>题目</th> 
   <th>题解</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>1</td> 
   <td>两数之和（多种解法）</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106595078" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>2</td> 
   <td>两数相加</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107872193" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>3</td> 
   <td>无重复字符的最长子串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107877584" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>5</td> 
   <td>最长回文串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106775026" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>7</td> 
   <td>整数反转</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106318793" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>8</td> 
   <td>字符串转换整数 (atoi)</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106344843" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>9</td> 
   <td>回文数</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106608248" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>11</td> 
   <td>盛最多水的容器</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108562434" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>12</td> 
   <td>整数装罗马数字</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108644490" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>13</td> 
   <td>罗马数字转整数</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108556964" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>14</td> 
   <td>最长公共前缀</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106774709" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>15</td> 
   <td>三数之和</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106596357" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>16</td> 
   <td>最接近的三数之和</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108562048" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>17</td> 
   <td>电话号码的字母组合</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/105822900" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>18</td> 
   <td>四数之和</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108620334" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>19</td> 
   <td>删除链表的倒数第N个节点</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106673376" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>20</td> 
   <td>有效的括号</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106726181" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>21</td> 
   <td>合并两个有序链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106650834" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>22</td> 
   <td>括号生成</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108305376" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>25</td> 
   <td>K 个一组翻转链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108231000" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>28</td> 
   <td>实现 strStr()</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106755025" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>33</td> 
   <td>搜索旋转排序数组</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108452058" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>34</td> 
   <td>在排序数组中查找元素的第一个和最后一个位置</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108551378" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>35</td> 
   <td>搜索插入位置</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108557131" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>36</td> 
   <td>有效的数独</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108599335" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>37</td> 
   <td>解数独</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108597262" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>39</td> 
   <td>组合总和</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108486567" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>40</td> 
   <td>组合总和 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108521564" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>46</td> 
   <td>全排列</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108549192" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>47</td> 
   <td>全排列 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108549952" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>49</td> 
   <td>字母异位词分组</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108030084" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>50</td> 
   <td>Pow(x,n)</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107993415" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>56</td> 
   <td>合并区间</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108446322" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>60</td> 
   <td>第k个排列</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108426043" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>67</td> 
   <td>二进制求和</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108656745" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>69</td> 
   <td>x的平方根</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108656803" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>73</td> 
   <td>矩阵置零</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108030301" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>76</td> 
   <td>最小覆盖子串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107881230" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>77</td> 
   <td>组合</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108465322" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>78</td> 
   <td>子集</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108689658" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>79</td> 
   <td>单词搜索</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108557723" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>82</td> 
   <td>删除排序链表中的重复元素 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106651527" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>88</td> 
   <td>合并两个有序数组</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106595622" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>92</td> 
   <td>反转链表 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106677585" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>94</td> 
   <td>二叉树的中序遍历</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/105973380" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>98</td> 
   <td>验证二叉搜索树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106980295" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>100</td> 
   <td>相同的树</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108656579" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>101</td> 
   <td>对称二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108091477" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>102</td> 
   <td>二叉树的层序遍历</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106008688" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>103</td> 
   <td>二叉树的锯齿形层次遍历</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108178427" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>104</td> 
   <td>二叉树的最大深度</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106009246" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>105</td> 
   <td>从前序与中序遍历序列构造二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108176121" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>106</td> 
   <td>从中序与后序遍历序列构造二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108176759" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>107</td> 
   <td>二叉树的层次遍历 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108436319" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>108</td> 
   <td>将有序数组转换为二叉搜索树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106980794" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>109</td> 
   <td>有序链表转换二叉搜索树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108090951" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>110</td> 
   <td>平衡二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107151605" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>111</td> 
   <td>二叉树的最小深度</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106029306" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>113</td> 
   <td>路径总和 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108458113" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>116</td> 
   <td>填充每个节点的下一个右侧节点指针</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108178311" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>125</td> 
   <td>验证回文串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106610031" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>141</td> 
   <td>环形链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106699551" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>142</td> 
   <td>环形链表 II</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106699636" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>143</td> 
   <td>重排链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108468070" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>144</td> 
   <td>二叉树的前序遍历</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/105970362" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>145</td> 
   <td>二叉树的后序遍历</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/105973618" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>148</td> 
   <td>链表排序</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108044466" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>160</td> 
   <td>相交链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108067127" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>169</td> 
   <td>多数元素</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108230508" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>199</td> 
   <td>二叉树的右视图</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108448678" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>200</td> 
   <td>岛屿数量</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107501754" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>206</td> 
   <td>反转链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106676536" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>209</td> 
   <td>长度最小的子数组</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108457712" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>215</td> 
   <td>数组中的第K个最大元素</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108436611" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>216</td> 
   <td>组合总和 III</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108533215" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>226</td> 
   <td>翻转二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106934386" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>230</td> 
   <td>二叉搜索树中第K小的元素</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108177292" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>234</td> 
   <td>回文链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108040927" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>238</td> 
   <td>除自身以外数组的乘积</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108011204" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>242</td> 
   <td>有效的字母异位词</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106319523" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>257</td> 
   <td>二叉树的所有路径</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108447339" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>297</td> 
   <td>二叉树的序列化与反序列化</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108174850" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>328</td> 
   <td>奇偶链表</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108067365" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>334</td> 
   <td>递增的三元子序列</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108030951" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>347</td> 
   <td>前 K 个高频元素</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108444782" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>387</td> 
   <td>字符串中的第一个唯一字符</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106754443" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>404</td> 
   <td>左叶子之和</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108685269" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>409</td> 
   <td>最长回文串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107501311" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>461</td> 
   <td>汉明距离</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108190300" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>486</td> 
   <td>预测赢家</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108352533" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>509</td> 
   <td>斐波那契数</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107132556" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>530</td> 
   <td>二叉搜索树的最小绝对差</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108468530" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>538</td> 
   <td>把二叉搜索树转换为累加树</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108720948" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>557</td> 
   <td>反转字符串中的单词 III</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/105259929" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>617</td> 
   <td>合并二叉树</td> 
   <td><a href="https://cuggz.blog.csdn.net/article/details/108755457" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>637</td> 
   <td>二叉树的层平均值</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108548070" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>647</td> 
   <td>回文子串</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108091259" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>680</td> 
   <td>验证回文字符串 Ⅱ</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106609809" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>700</td> 
   <td>二叉搜索树中的搜索</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106934586" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>701</td> 
   <td>二叉搜索树中的插入操作</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106935576" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>733</td> 
   <td>图像渲染</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108040433" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>739</td> 
   <td>每日温度</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/106753464" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>889</td> 
   <td>根据前序和后序遍历构造二叉树</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/108176496" rel="nofollow">点击查看</a></td> 
  </tr> 
  <tr> 
   <td>1382</td> 
   <td>将二叉搜索树变平衡</td> 
   <td><a href="https://blog.csdn.net/qq_42033567/article/details/107152298" rel="nofollow">点击查看</a></td> 
  </tr> 
 </tbody> 
</table>

持续更新中…