Skip to content

Commit e8deefc

Browse files
yanglbmeyanglbme
committed
deploy: 8a70139 
1 parent ce50f05 commit e8deefc

File tree

16 files changed

+7572
-7374
lines changed

16 files changed

+7572
-7374
lines changed

‎en/lc/1320/index.html

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -80692,11 +80692,11 @@ <h2 id="description">Description</h2>
8069280692
<pre>
8069380693
<strong>Input:</strong> word = &quot;CAKE&quot;
8069480694
<strong>Output:</strong> 3
80695-
<strong>Explanation:</strong> Using two fingers, one optimal way to type &quot;CAKE&quot; is:
80696-
Finger 1 on letter &#39;C&#39; -&gt; cost = 0
80697-
Finger 1 on letter &#39;A&#39; -&gt; cost = Distance from letter &#39;C&#39; to letter &#39;A&#39; = 2
80698-
Finger 2 on letter &#39;K&#39; -&gt; cost = 0
80699-
Finger 2 on letter &#39;E&#39; -&gt; cost = Distance from letter &#39;K&#39; to letter &#39;E&#39; = 1
80695+
<strong>Explanation:</strong> Using two fingers, one optimal way to type &quot;CAKE&quot; is:
80696+
Finger 1 on letter &#39;C&#39; -&gt; cost = 0
80697+
Finger 1 on letter &#39;A&#39; -&gt; cost = Distance from letter &#39;C&#39; to letter &#39;A&#39; = 2
80698+
Finger 2 on letter &#39;K&#39; -&gt; cost = 0
80699+
Finger 2 on letter &#39;E&#39; -&gt; cost = Distance from letter &#39;K&#39; to letter &#39;E&#39; = 1
8070080700
Total distance = 3
8070180701
</pre>
8070280702

‎en/lc/2577/index.html

Lines changed: 131 additions & 2 deletions
Large diffs are not rendered by default.

‎en/lc/3232/index.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -80730,7 +80730,7 @@ <h2 id="solutions">Solutions</h2>
8073080730
<!-- solution:start -->
8073180731

8073280732
<h3 id="solution-1-summation">Solution 1: Summation</h3>
80733-
<p>According to the problem description, as long as the sum of the units digits is not equal to the sum of the tens digits, Xiaohong can always choose a larger sum to win.</p>
80733+
<p>According to the problem description, as long as the sum of the units digits is not equal to the sum of the tens digits, Alice can always choose a larger sum to win.</p>
8073480734
<p>The time complexity is $O(n)$, where $n$ is the length of the array $\textit{nums}$. The space complexity is $O(1)$.</p>
8073580735
<div class="tabbed-set tabbed-alternate" data-tabs="1:5"><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" /><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></div>
8073680736
<div class="tabbed-content">

‎en/lc/451/index.html

Lines changed: 16 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -16735,9 +16735,9 @@
1673516735
<ul class="md-nav__list">
1673616736

1673716737
<li class="md-nav__item">
16738-
<a href="#solution-1" class="md-nav__link">
16738+
<a href="#solution-1-hash-table-sorting" class="md-nav__link">
1673916739
<span class="md-ellipsis">
16740-
Solution 1
16740+
Solution 1: Hash Table + Sorting
1674116741
</span>
1674216742
</a>
1674316743

@@ -80742,7 +80742,9 @@ <h2 id="description">Description</h2>
8074280742
<h2 id="solutions">Solutions</h2>
8074380743
<!-- solution:start -->
8074480744

80745-
<h3 id="solution-1">Solution 1</h3>
80745+
<h3 id="solution-1-hash-table-sorting">Solution 1: Hash Table + Sorting</h3>
80746+
<p>We use a hash table $\textit{cnt}$ to count the occurrences of each character in the string $s$. Then, we sort the key-value pairs in $\textit{cnt}$ in descending order by the number of occurrences. Finally, we concatenate the characters according to the sorted order.</p>
80747+
<p>The time complexity is $O(n + k \times \log k)$, and the space complexity is $O(n + k)$, where $n$ is the length of the string $s$, and $k$ is the number of distinct characters.</p>
8074680748
<div class="tabbed-set tabbed-alternate" data-tabs="1:7"><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" /><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">PHP</label></div>
8074780749
<div class="tabbed-content">
8074880750
<div class="tabbed-block">
@@ -80942,21 +80944,23 @@ <h3 id="solution-1">Solution 1</h3>
8094280944
<span class="normal">14</span>
8094380945
<span class="normal">15</span>
8094480946
<span class="normal">16</span>
80945-
<span class="normal">17</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="x">class Solution {</span>
80947+
<span class="normal">17</span>
80948+
<span class="normal">18</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="x">class Solution {</span>
8094680949
<span class="x"> /**</span>
8094780950
<span class="x"> * @param String $s</span>
8094880951
<span class="x"> * @return String</span>
8094980952
<span class="x"> */</span>
8095080953
<span class="x"> function frequencySort($s) {</span>
80951-
<span class="x"> for ($i = 0; $i &lt; strlen($s); $i++) {</span>
80952-
<span class="x"> $hashtable[$s[$i]] += 1;</span>
80953-
<span class="x"> }</span>
80954-
<span class="x"> arsort($hashtable);</span>
80955-
<span class="x"> $keys = array_keys($hashtable);</span>
80956-
<span class="x"> for ($j = 0; $j &lt; count($keys); $j++) {</span>
80957-
<span class="x"> $rs = $rs . str_repeat($keys[$j], $hashtable[$keys[$j]]);</span>
80954+
<span class="x"> $cnt = array_count_values(str_split($s));</span>
80955+
<span class="x"> $cs = array_keys($cnt);</span>
80956+
<span class="x"> usort($cs, function ($a, $b) use ($cnt) {</span>
80957+
<span class="x"> return $cnt[$b] &lt;=&gt; $cnt[$a];</span>
80958+
<span class="x"> });</span>
80959+
<span class="x"> $ans = &#39;&#39;;</span>
80960+
<span class="x"> foreach ($cs as $c) {</span>
80961+
<span class="x"> $ans .= str_repeat($c, $cnt[$c]);</span>
8095880962
<span class="x"> }</span>
80959-
<span class="x"> return $rs;</span>
80963+
<span class="x"> return $ans;</span>
8096080964
<span class="x"> }</span>
8096180965
<span class="x">}</span>
8096280966
</code></pre></div></td></tr></table></div>

‎en/lc/453/index.html

Lines changed: 21 additions & 45 deletions
Original file line numberDiff line numberDiff line change
@@ -16777,18 +16777,9 @@
1677716777
<ul class="md-nav__list">
1677816778

1677916779
<li class="md-nav__item">
16780-
<a href="#solution-1" class="md-nav__link">
16780+
<a href="#solution-1-mathematics" class="md-nav__link">
1678116781
<span class="md-ellipsis">
16782-
Solution 1
16783-
</span>
16784-
</a>
16785-
16786-
</li>
16787-
16788-
<li class="md-nav__item">
16789-
<a href="#solution-2" class="md-nav__link">
16790-
<span class="md-ellipsis">
16791-
Solution 2
16782+
Solution 1: Mathematics
1679216783
</span>
1679316784
</a>
1679416785

@@ -80718,7 +80709,25 @@ <h2 id="description">Description</h2>
8071880709
<h2 id="solutions">Solutions</h2>
8071980710
<!-- solution:start -->
8072080711

80721-
<h3 id="solution-1">Solution 1</h3>
80712+
<h3 id="solution-1-mathematics">Solution 1: Mathematics</h3>
80713+
<p>Let the minimum value of the array $\textit{nums}$ be $\textit{mi}$, the sum of the array be $\textit{s}$, and the length of the array be $\textit{n}$.</p>
80714+
<p>Assume the minimum number of operations is $\textit{k}$, and the final value of all elements in the array is $\textit{x}$. Then we have:</p>
80715+
<p>$$
80716+
\begin{aligned}
80717+
\textit{s} + (\textit{n} - 1) \times \textit{k} &amp;= \textit{n} \times \textit{x} \
80718+
\textit{x} &amp;= \textit{mi} + \textit{k} \
80719+
\end{aligned}
80720+
$$</p>
80721+
<p>Substituting the second equation into the first equation, we get:</p>
80722+
<p>$$
80723+
\begin{aligned}
80724+
\textit{s} + (\textit{n} - 1) \times \textit{k} &amp;= \textit{n} \times (\textit{mi} + \textit{k}) \
80725+
\textit{s} + (\textit{n} - 1) \times \textit{k} &amp;= \textit{n} \times \textit{mi} + \textit{n} \times \textit{k} \
80726+
\textit{k} &amp;= \textit{s} - \textit{n} \times \textit{mi} \
80727+
\end{aligned}
80728+
$$</p>
80729+
<p>Therefore, the minimum number of operations is $\textit{s} - \textit{n} \times \textit{mi}$.</p>
80730+
<p>The time complexity is $O(n)$, and the space complexity is $O(1)$. Here, $n$ is the length of the array.</p>
8072280731
<div class="tabbed-set tabbed-alternate" data-tabs="1:5"><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" /><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></div>
8072380732
<div class="tabbed-content">
8072480733
<div class="tabbed-block">
@@ -80815,39 +80824,6 @@ <h3 id="solution-1">Solution 1</h3>
8081580824
</div>
8081680825
<!-- solution:end -->
8081780826

80818-
<!-- solution:start -->
80819-
80820-
<h3 id="solution-2">Solution 2</h3>
80821-
<div class="tabbed-set tabbed-alternate" data-tabs="2:1"><input checked="checked" id="__tabbed_2_1" name="__tabbed_2" type="radio" /><div class="tabbed-labels"><label for="__tabbed_2_1">Java</label></div>
80822-
<div class="tabbed-content">
80823-
<div class="tabbed-block">
80824-
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
80825-
<span class="normal"> 2</span>
80826-
<span class="normal"> 3</span>
80827-
<span class="normal"> 4</span>
80828-
<span class="normal"> 5</span>
80829-
<span class="normal"> 6</span>
80830-
<span class="normal"> 7</span>
80831-
<span class="normal"> 8</span>
80832-
<span class="normal"> 9</span>
80833-
<span class="normal">10</span>
80834-
<span class="normal">11</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="kd">class</span> <span class="nc">Solution</span><span class="w"> </span><span class="p">{</span>
80835-
<span class="w"> </span><span class="kd">public</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="nf">minMoves</span><span class="p">(</span><span class="kt">int</span><span class="o">[]</span><span class="w"> </span><span class="n">nums</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
80836-
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
80837-
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">mi</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">&lt;&lt;</span><span class="w"> </span><span class="mi">30</span><span class="p">;</span>
80838-
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">nums</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
80839-
<span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="n">x</span><span class="p">;</span>
80840-
<span class="w"> </span><span class="n">mi</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Math</span><span class="p">.</span><span class="na">min</span><span class="p">(</span><span class="n">mi</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">);</span>
80841-
<span class="w"> </span><span class="p">}</span>
80842-
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">mi</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nums</span><span class="p">.</span><span class="na">length</span><span class="p">;</span>
80843-
<span class="w"> </span><span class="p">}</span>
80844-
<span class="p">}</span>
80845-
</code></pre></div></td></tr></table></div>
80846-
</div>
80847-
</div>
80848-
</div>
80849-
<!-- solution:end -->
80850-
8085180827
<!-- problem:end -->
8085280828

8085380829

‎en/search/search_index.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)