Skip to content

Commit 11e3084

Browse files
committed
deploy: 42e99e8
1 parent 4f52227 commit 11e3084

File tree

9 files changed

+288
-1353
lines changed

9 files changed

+288
-1353
lines changed

en/lc/1346/index.html

Lines changed: 26 additions & 610 deletions
Large diffs are not rendered by default.

en/lc/1486/index.html

Lines changed: 11 additions & 37 deletions
Original file line numberDiff line numberDiff line change
@@ -38012,18 +38012,9 @@
3801238012
<ul class="md-nav__list">
3801338013

3801438014
<li class="md-nav__item">
38015-
<a href="#solution-1" class="md-nav__link">
38015+
<a href="#solution-1-simulation" class="md-nav__link">
3801638016
<span class="md-ellipsis">
38017-
Solution 1
38018-
</span>
38019-
</a>
38020-
38021-
</li>
38022-
38023-
<li class="md-nav__item">
38024-
<a href="#solution-2" class="md-nav__link">
38025-
<span class="md-ellipsis">
38026-
Solution 2
38017+
Solution 1: Simulation
3802738018
</span>
3802838019
</a>
3802938020

@@ -75466,21 +75457,17 @@ <h2 id="description">Description</h2>
7546675457
</ul>
7546775458

7546875459
<h2 id="solutions">Solutions</h2>
75469-
<h3 id="solution-1">Solution 1</h3>
75460+
<h3 id="solution-1-simulation">Solution 1: Simulation</h3>
75461+
<p>We can directly simulate to calculate the XOR result of all elements in the array.</p>
75462+
<p>The time complexity is $O(n)$, where $n$ is the length of the array. The space complexity is $O(1)$.</p>
7547075463
<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>
7547175464
<div class="tabbed-content">
7547275465
<div class="tabbed-block">
7547375466
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
7547475467
<span class="normal">2</span>
75475-
<span class="normal">3</span>
75476-
<span class="normal">4</span>
75477-
<span class="normal">5</span>
75478-
<span class="normal">6</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
75468+
<span class="normal">3</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
7547975469
<span class="k">def</span> <span class="nf">xorOperation</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">n</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">start</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
75480-
<span class="n">ans</span> <span class="o">=</span> <span class="mi">0</span>
75481-
<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
75482-
<span class="n">ans</span> <span class="o">^=</span> <span class="n">start</span> <span class="o">+</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">i</span>
75483-
<span class="k">return</span> <span class="n">ans</span>
75470+
<span class="k">return</span> <span class="n">reduce</span><span class="p">(</span><span class="n">xor</span><span class="p">,</span> <span class="p">((</span><span class="n">start</span> <span class="o">+</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">i</span><span class="p">)</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">)))</span>
7548475471
</code></pre></div></td></tr></table></div>
7548575472
</div>
7548675473
<div class="tabbed-block">
@@ -75557,19 +75544,6 @@ <h3 id="solution-1">Solution 1</h3>
7555775544
</div>
7555875545
</div>
7555975546
</div>
75560-
<h3 id="solution-2">Solution 2</h3>
75561-
<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">Python3</label></div>
75562-
<div class="tabbed-content">
75563-
<div class="tabbed-block">
75564-
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
75565-
<span class="normal">2</span>
75566-
<span class="normal">3</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
75567-
<span class="k">def</span> <span class="nf">xorOperation</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">n</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">start</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
75568-
<span class="k">return</span> <span class="n">reduce</span><span class="p">(</span><span class="n">xor</span><span class="p">,</span> <span class="p">((</span><span class="n">start</span> <span class="o">+</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">i</span><span class="p">)</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">)))</span>
75569-
</code></pre></div></td></tr></table></div>
75570-
</div>
75571-
</div>
75572-
</div>
7557375547
<!-- end -->
7557475548

7557575549

@@ -75599,14 +75573,14 @@ <h3 id="solution-2">Solution 2</h3>
7559975573

7560075574
<nav>
7560175575

75602-
<a href="https://github.com/cblh" class="md-author" title="@cblh">
75576+
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
7560375577

75604-
<img src="https://avatars.githubusercontent.com/u/4357401?v=4&size=72" alt="cblh">
75578+
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
7560575579
</a>
7560675580

75607-
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
75581+
<a href="https://github.com/cblh" class="md-author" title="@cblh">
7560875582

75609-
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
75583+
<img src="https://avatars.githubusercontent.com/u/4357401?v=4&size=72" alt="cblh">
7561075584
</a>
7561175585

7561275586
<a href="https://github.com/0xcaffebabe" class="md-author" title="@0xcaffebabe">

en/lc/1491/index.html

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -38117,9 +38117,9 @@
3811738117
<ul class="md-nav__list">
3811838118

3811938119
<li class="md-nav__item">
38120-
<a href="#solution-1" class="md-nav__link">
38120+
<a href="#solution-1-simulation" class="md-nav__link">
3812138121
<span class="md-ellipsis">
38122-
Solution 1
38122+
Solution 1: Simulation
3812338123
</span>
3812438124
</a>
3812538125

@@ -75456,7 +75456,10 @@ <h2 id="description">Description</h2>
7545675456
</ul>
7545775457

7545875458
<h2 id="solutions">Solutions</h2>
75459-
<h3 id="solution-1">Solution 1</h3>
75459+
<h3 id="solution-1-simulation">Solution 1: Simulation</h3>
75460+
<p>Simulate according to the problem's requirements.</p>
75461+
<p>Traverse the array, find the maximum and minimum values, and accumulate the sum. Then calculate the average value after removing the maximum and minimum values.</p>
75462+
<p>The time complexity is $O(n)$, where $n$ is the length of the array <code>salary</code>. The space complexity is $O(1)$.</p>
7546075463
<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">PHP</label><label for="__tabbed_1_8">C</label></div>
7546175464
<div class="tabbed-content">
7546275465
<div class="tabbed-block">

0 commit comments

Comments
 (0)