deploy: 398146b

Author: yanglbme

en/lc/146/index.html

@@ -81861,11 +81861,7 @@ <h3 id="solution-1-priority-queue-min-heap">Solution 1: Priority Queue (Min Heap
 <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></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/**</span>
+<span class="normal">27</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/**</span>
 <span class="cm"> * Definition for singly-linked list.</span>
 <span class="cm"> * class ListNode {</span>
 <span class="cm"> *     val: number</span>
@@ -81879,11 +81875,7 @@ <h3 id="solution-1-priority-queue-min-heap">Solution 1: Priority Queue (Min Heap
 
 <span class="kd">function</span><span class="w"> </span><span class="nx">mergeKLists</span><span class="p">(</span><span class="nx">lists</span><span class="o">:</span><span class="w"> </span><span class="kt">Array</span><span class="o">&lt;</span><span class="nx">ListNode</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="kc">null</span><span class="o">&gt;</span><span class="p">)</span><span class="o">:</span><span class="w"> </span><span class="nx">ListNode</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="kc">null</span><span class="w"> </span><span class="p">{</span>
 <span class="w">    </span><span class="kd">const</span><span class="w"> </span><span class="nx">pq</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="ow">new</span><span class="w"> </span><span class="nx">MinPriorityQueue</span><span class="p">({</span><span class="w"> </span><span class="nx">priority</span><span class="o">:</span><span class="w"> </span><span class="p">(</span><span class="nx">node</span><span class="o">:</span><span class="w"> </span><span class="kt">ListNode</span><span class="p">)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">node</span><span class="p">.</span><span class="nx">val</span><span class="w"> </span><span class="p">});</span>
-<span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kd">const</span><span class="w"> </span><span class="nx">head</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="nx">lists</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nx">head</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">            </span><span class="nx">pq</span><span class="p">.</span><span class="nx">enqueue</span><span class="p">(</span><span class="nx">head</span><span class="p">);</span>
-<span class="w">        </span><span class="p">}</span>
-<span class="w">    </span><span class="p">}</span>
+<span class="w">    </span><span class="nx">lists</span><span class="p">.</span><span class="nx">filter</span><span class="p">(</span><span class="nx">head</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">head</span><span class="p">).</span><span class="nx">forEach</span><span class="p">(</span><span class="nx">head</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">pq</span><span class="p">.</span><span class="nx">enqueue</span><span class="p">(</span><span class="nx">head</span><span class="p">));</span>
 <span class="w">    </span><span class="kd">const</span><span class="w"> </span><span class="nx">dummy</span><span class="o">:</span><span class="w"> </span><span class="kt">ListNode</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="ow">new</span><span class="w"> </span><span class="nx">ListNode</span><span class="p">();</span>
 <span class="w">    </span><span class="kd">let</span><span class="w"> </span><span class="nx">cur</span><span class="o">:</span><span class="w"> </span><span class="kt">ListNode</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nx">dummy</span><span class="p">;</span>
 <span class="w">    </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="nx">pq</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">())</span><span class="w"> </span><span class="p">{</span>
@@ -82018,11 +82010,7 @@ <h3 id="solution-1-priority-queue-min-heap">Solution 1: Priority Queue (Min Heap
 <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></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/**</span>
+<span class="normal">26</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="cm">/**</span>
 <span class="cm"> * Definition for singly-linked list.</span>
 <span class="cm"> * function ListNode(val, next) {</span>
 <span class="cm"> *     this.val = (val===undefined ? 0 : val)</span>
@@ -82035,11 +82023,7 @@ <h3 id="solution-1-priority-queue-min-heap">Solution 1: Priority Queue (Min Heap
 <span class="cm"> */</span>
 <span class="kd">var</span><span class="w"> </span><span class="nx">mergeKLists</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kd">function</span><span class="w"> </span><span class="p">(</span><span class="nx">lists</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
 <span class="w">    </span><span class="kd">const</span><span class="w"> </span><span class="nx">pq</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="ow">new</span><span class="w"> </span><span class="nx">MinPriorityQueue</span><span class="p">({</span><span class="w"> </span><span class="nx">priority</span><span class="o">:</span><span class="w"> </span><span class="nx">node</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">node</span><span class="p">.</span><span class="nx">val</span><span class="w"> </span><span class="p">});</span>
-<span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kd">const</span><span class="w"> </span><span class="nx">head</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="nx">lists</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nx">head</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">            </span><span class="nx">pq</span><span class="p">.</span><span class="nx">enqueue</span><span class="p">(</span><span class="nx">head</span><span class="p">);</span>
-<span class="w">        </span><span class="p">}</span>
-<span class="w">    </span><span class="p">}</span>
+<span class="w">    </span><span class="nx">lists</span><span class="p">.</span><span class="nx">filter</span><span class="p">(</span><span class="nx">head</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">head</span><span class="p">).</span><span class="nx">forEach</span><span class="p">(</span><span class="nx">head</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">pq</span><span class="p">.</span><span class="nx">enqueue</span><span class="p">(</span><span class="nx">head</span><span class="p">));</span>
 <span class="w">    </span><span class="kd">const</span><span class="w"> </span><span class="nx">dummy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="ow">new</span><span class="w"> </span><span class="nx">ListNode</span><span class="p">();</span>
 <span class="w">    </span><span class="kd">let</span><span class="w"> </span><span class="nx">cur</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nx">dummy</span><span class="p">;</span>
 <span class="w">    </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="nx">pq</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">())</span><span class="w"> </span><span class="p">{</span>

en/lc/23/index.html

@@ -20967,9 +20967,9 @@
       <ul class="md-nav__list">
 
           <li class="md-nav__item">
-  <a href="#solution-1" class="md-nav__link">
+  <a href="#solution-1-queue-simulation" class="md-nav__link">
     <span class="md-ellipsis">
-      Solution 1
+      Solution 1: Queue + Simulation
     </span>
   </a>
 
@@ -81551,9 +81551,9 @@ <h2 id="description">Description</h2>
 <pre>
 <strong>Input:</strong> senate = &quot;RD&quot;
 <strong>Output:</strong> &quot;Radiant&quot;
-<strong>Explanation:</strong> 
-The first senator comes from Radiant and he can just ban the next senator&#39;s right in round 1. 
-And the second senator can&#39;t exercise any rights anymore since his right has been banned. 
+<strong>Explanation:</strong>
+The first senator comes from Radiant and he can just ban the next senator&#39;s right in round 1.
+And the second senator can&#39;t exercise any rights anymore since his right has been banned.
 And in round 2, the first senator can just announce the victory since he is the only guy in the senate who can vote.
 </pre>
 
@@ -81562,10 +81562,10 @@ <h2 id="description">Description</h2>
 <pre>
 <strong>Input:</strong> senate = &quot;RDD&quot;
 <strong>Output:</strong> &quot;Dire&quot;
-<strong>Explanation:</strong> 
-The first senator comes from Radiant and he can just ban the next senator&#39;s right in round 1. 
-And the second senator can&#39;t exercise any rights anymore since his right has been banned. 
-And the third senator comes from Dire and he can ban the first senator&#39;s right in round 1. 
+<strong>Explanation:</strong>
+The first senator comes from Radiant and he can just ban the next senator&#39;s right in round 1.
+And the second senator can&#39;t exercise any rights anymore since his right has been banned.
+And the third senator comes from Dire and he can ban the first senator&#39;s right in round 1.
 And in round 2, the third senator can just announce the victory since he is the only guy in the senate who can vote.
 </pre>
 
@@ -81583,7 +81583,14 @@ <h2 id="description">Description</h2>
 <h2 id="solutions">Solutions</h2>
 <!-- solution:start -->
 
-<h3 id="solution-1">Solution 1</h3>
+<h3 id="solution-1-queue-simulation">Solution 1: Queue + Simulation</h3>
+<p>We create two queues $qr$ and $qd$ to record the indices of the Radiant and Dire senators, respectively. Then we start the simulation, where in each round we dequeue one senator from each queue and perform different operations based on their factions:</p>
+<ul>
+<li>If the Radiant senator's index is less than the Dire senator's index, the Radiant senator can permanently ban the voting rights of the Dire senator. We add $n$ to the Radiant senator's index and enqueue it back to the end of the queue, indicating that this senator will participate in the next round of voting.</li>
+<li>If the Dire senator's index is less than the Radiant senator's index, the Dire senator can permanently ban the voting rights of the Radiant senator. We add $n$ to the Dire senator's index and enqueue it back to the end of the queue, indicating that this senator will participate in the next round of voting.</li>
+</ul>
+<p>Finally, when there are only senators from one faction left in the queues, the senators from that faction win.</p>
+<p>The time complexity is $O(n)$, and the space complexity is $O(n)$. Here, $n$ is the number of senators.</p>
 <div class="tabbed-set tabbed-alternate" data-tabs="1:6"><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" /><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></div>
 <div class="tabbed-content">
 <div class="tabbed-block">