deploy: d9494c8

Author: yanglbme

en/lc/691/index.html

@@ -80439,7 +80439,7 @@ <h2 id="_2">解法</h2>
 <h3 id="_3">方法一：头插法</h3>
 <p>创建虚拟头节点 $dummy$，遍历链表，将每个节点依次插入 $dummy$ 的下一个节点。遍历结束，返回 $dummy.next$。</p>
 <p>时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为链表的长度。</p>
-<div class="tabbed-set tabbed-alternate" data-tabs="1:8"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">C#</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="1:9"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><input id="__tabbed_1_9" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">C#</label><label for="__tabbed_1_9">Swift</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block">
 <div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
@@ -80803,6 +80803,58 @@ <h3 id="_3">方法一：头插法</h3>
 <span class="p">}</span>
 </code></pre></div></td></tr></table></div>
 </div>
+<div class="tabbed-block">
+<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
+<span class="normal"> 2</span>
+<span class="normal"> 3</span>
+<span class="normal"> 4</span>
+<span class="normal"> 5</span>
+<span class="normal"> 6</span>
+<span class="normal"> 7</span>
+<span class="normal"> 8</span>
+<span class="normal"> 9</span>
+<span class="normal">10</span>
+<span class="normal">11</span>
+<span class="normal">12</span>
+<span class="normal">13</span>
+<span class="normal">14</span>
+<span class="normal">15</span>
+<span class="normal">16</span>
+<span class="normal">17</span>
+<span class="normal">18</span>
+<span class="normal">19</span>
+<span class="normal">20</span>
+<span class="normal">21</span>
+<span class="normal">22</span>
+<span class="normal">23</span>
+<span class="normal">24</span>
+<span class="normal">25</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/* public class ListNode {</span>
+<span class="cm">*     var val: Int</span>
+<span class="cm">*     var next: ListNode?</span>
+<span class="cm">*     init(_ val: Int) {</span>
+<span class="cm">*         self.val = val</span>
+<span class="cm">*         self.next = nil</span>
+<span class="cm">*     }</span>
+<span class="cm">* }</span>
+<span class="cm">*/</span>
+
+<span class="kd">class</span> <span class="nc">Solution</span> <span class="p">{</span>
+    <span class="kd">func</span> <span class="nf">reverseList</span><span class="p">(</span><span class="kc">_</span> <span class="n">head</span><span class="p">:</span> <span class="n">ListNode</span><span class="p">?)</span> <span class="p">-&gt;</span> <span class="n">ListNode</span><span class="p">?</span> <span class="p">{</span>
+        <span class="kd">let</span> <span class="nv">dummy</span> <span class="p">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
+        <span class="kd">var</span> <span class="nv">curr</span> <span class="p">=</span> <span class="n">head</span>
+
+        <span class="k">while</span> <span class="n">curr</span> <span class="o">!=</span> <span class="kc">nil</span> <span class="p">{</span>
+            <span class="kd">let</span> <span class="nv">next</span> <span class="p">=</span> <span class="n">curr</span><span class="p">?.</span><span class="n">next</span>
+            <span class="n">curr</span><span class="p">?.</span><span class="n">next</span> <span class="p">=</span> <span class="n">dummy</span><span class="p">.</span><span class="n">next</span>
+            <span class="n">dummy</span><span class="p">.</span><span class="n">next</span> <span class="p">=</span> <span class="n">curr</span>
+            <span class="n">curr</span> <span class="p">=</span> <span class="n">next</span>
+        <span class="p">}</span>
+
+        <span class="k">return</span> <span class="n">dummy</span><span class="p">.</span><span class="n">next</span>
+    <span class="p">}</span>
+<span class="p">}</span>
+</code></pre></div></td></tr></table></div>
+</div>
 </div>
 </div>
 <!-- solution:end -->
@@ -81121,6 +81173,11 @@ <h3 id="_4">方法二：递归</h3>
 
     <nav>
 
+        <a href="https://github.com/klever34" class="md-author" title="@klever34">
+          
+          <img src="https://avatars.githubusercontent.com/u/12745225?v=4&size=72" alt="klever34">
+        </a>
+      
         <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
           <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
@@ -81136,16 +81193,11 @@ <h3 id="_4">方法二：递归</h3>
           <img src="https://avatars.githubusercontent.com/u/70502828?v=4&size=72" alt="YangFong">
         </a>
 
-        <a href="https://github.com/maolonglong" class="md-author" title="@maolonglong">
-          
-          <img src="https://avatars.githubusercontent.com/u/50797868?v=4&size=72" alt="maolonglong">
-        </a>
-      
 
 
 
           <a href="https://github.com/doocs/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/README.md" class="md-author md-author--more">
-            +2
+            +3
           </a>
 
 

en/search/search_index.json

@@ -80435,7 +80435,7 @@ <h3 id="_3">方法一：迭代</h3>
 <p>接下来，循环比较 <code>l1</code> 和 <code>l2</code> 的值，将较小的值接在 <code>cur</code> 后面，然后将指针向后移动一位。循环结束，将 <code>cur</code> 指向 <code>l1</code> 或者 <code>l2</code> 中剩余的部分。</p>
 <p>最后返回 <code>dummy.next</code> 即可。</p>
 <p>时间复杂度 $O(m + n)$，空间复杂度 $O(1)$。其中 $m$ 和 $n$ 分别为两个链表的长度。</p>
-<div class="tabbed-set tabbed-alternate" data-tabs="1:8"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">C#</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="1:9"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><input id="__tabbed_1_9" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">C#</label><label for="__tabbed_1_9">Swift</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block">
 <div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
@@ -80909,6 +80909,74 @@ <h3 id="_3">方法一：迭代</h3>
 <span class="p">}</span>
 </code></pre></div></td></tr></table></div>
 </div>
+<div class="tabbed-block">
+<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
+<span class="normal"> 2</span>
+<span class="normal"> 3</span>
+<span class="normal"> 4</span>
+<span class="normal"> 5</span>
+<span class="normal"> 6</span>
+<span class="normal"> 7</span>
+<span class="normal"> 8</span>
+<span class="normal"> 9</span>
+<span class="normal">10</span>
+<span class="normal">11</span>
+<span class="normal">12</span>
+<span class="normal">13</span>
+<span class="normal">14</span>
+<span class="normal">15</span>
+<span class="normal">16</span>
+<span class="normal">17</span>
+<span class="normal">18</span>
+<span class="normal">19</span>
+<span class="normal">20</span>
+<span class="normal">21</span>
+<span class="normal">22</span>
+<span class="normal">23</span>
+<span class="normal">24</span>
+<span class="normal">25</span>
+<span class="normal">26</span>
+<span class="normal">27</span>
+<span class="normal">28</span>
+<span class="normal">29</span>
+<span class="normal">30</span>
+<span class="normal">31</span>
+<span class="normal">32</span>
+<span class="normal">33</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/* public class ListNode {</span>
+<span class="cm">*     var val: Int</span>
+<span class="cm">*     var next: ListNode?</span>
+<span class="cm">*     init(_ val: Int) {</span>
+<span class="cm">*         self.val = val</span>
+<span class="cm">*         self.next = nil</span>
+<span class="cm">*     }</span>
+<span class="cm">* }</span>
+<span class="cm">*/</span>
+
+<span class="kd">class</span> <span class="nc">Solution</span> <span class="p">{</span>
+    <span class="kd">func</span> <span class="nf">mergeTwoLists</span><span class="p">(</span><span class="kc">_</span> <span class="n">l1</span><span class="p">:</span> <span class="n">ListNode</span><span class="p">?,</span> <span class="kc">_</span> <span class="n">l2</span><span class="p">:</span> <span class="n">ListNode</span><span class="p">?)</span> <span class="p">-&gt;</span> <span class="n">ListNode</span><span class="p">?</span> <span class="p">{</span>
+        <span class="kd">let</span> <span class="nv">dummy</span> <span class="p">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
+        <span class="kd">var</span> <span class="nv">cur</span><span class="p">:</span> <span class="n">ListNode</span><span class="p">?</span> <span class="p">=</span> <span class="n">dummy</span>
+        <span class="kd">var</span> <span class="nv">l1</span> <span class="p">=</span> <span class="n">l1</span>
+        <span class="kd">var</span> <span class="nv">l2</span> <span class="p">=</span> <span class="n">l2</span>
+
+        <span class="k">while</span> <span class="kd">let</span> <span class="nv">l1Node</span> <span class="p">=</span> <span class="n">l1</span><span class="p">,</span> <span class="kd">let</span> <span class="nv">l2Node</span> <span class="p">=</span> <span class="n">l2</span> <span class="p">{</span>
+            <span class="k">if</span> <span class="n">l1Node</span><span class="p">.</span><span class="n">val</span> <span class="o">&lt;=</span> <span class="n">l2Node</span><span class="p">.</span><span class="n">val</span> <span class="p">{</span>
+                <span class="n">cur</span><span class="p">?.</span><span class="n">next</span> <span class="p">=</span> <span class="n">l1Node</span>
+                <span class="n">l1</span> <span class="p">=</span> <span class="n">l1Node</span><span class="p">.</span><span class="n">next</span>
+            <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+                <span class="n">cur</span><span class="p">?.</span><span class="n">next</span> <span class="p">=</span> <span class="n">l2Node</span>
+                <span class="n">l2</span> <span class="p">=</span> <span class="n">l2Node</span><span class="p">.</span><span class="n">next</span>
+            <span class="p">}</span>
+            <span class="n">cur</span> <span class="p">=</span> <span class="n">cur</span><span class="p">?.</span><span class="n">next</span>
+        <span class="p">}</span>
+
+        <span class="n">cur</span><span class="p">?.</span><span class="n">next</span> <span class="p">=</span> <span class="n">l1</span> <span class="p">??</span> <span class="n">l2</span>
+
+        <span class="k">return</span> <span class="n">dummy</span><span class="p">.</span><span class="n">next</span>
+    <span class="p">}</span>
+<span class="p">}</span>
+</code></pre></div></td></tr></table></div>
+</div>
 </div>
 </div>
 <!-- solution:end -->
@@ -81372,6 +81440,11 @@ <h3 id="_4">方法二：递归</h3>
 
     <nav>
 
+        <a href="https://github.com/klever34" class="md-author" title="@klever34">
+          
+          <img src="https://avatars.githubusercontent.com/u/12745225?v=4&size=72" alt="klever34">
+        </a>
+      
         <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
           <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
@@ -81387,16 +81460,11 @@ <h3 id="_4">方法二：递归</h3>
           <img src="https://avatars.githubusercontent.com/u/70502828?v=4&size=72" alt="YangFong">
         </a>
 
-        <a href="https://github.com/ChunelFeng" class="md-author" title="@ChunelFeng">
-          
-          <img src="https://avatars.githubusercontent.com/u/37905059?v=4&size=72" alt="ChunelFeng">
-        </a>
-      
 
 
 
           <a href="https://github.com/doocs/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8/README.md" class="md-author md-author--more">
-            +2
+            +3
           </a>