Skip to content

Commit 48234c7

Browse files
yanglbmeyanglbme
committed
deploy: 8b3999e 
1 parent 7f78bf0 commit 48234c7

File tree

6 files changed

+1885
-1795
lines changed

6 files changed

+1885
-1795
lines changed

‎contest/index.html

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

‎en/lc/1555/index.html

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -75799,6 +75799,41 @@ <h3 id="solution-1">Solution 1</h3>
7579975799

7580075800

7580175801

75802+
<aside class="md-source-file">
75803+
75804+
75805+
75806+
75807+
75808+
<span class="md-source-file__fact">
75809+
75810+
75811+
<span class="md-icon" title="Contributors">
75812+
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12 2A10 10 0 0 0 2 12c0 4.42 2.87 8.17 6.84 9.5.5.08.66-.23.66-.5v-1.69c-2.77.6-3.36-1.34-3.36-1.34-.46-1.16-1.11-1.47-1.11-1.47-.91-.62.07-.6.07-.6 1 .07 1.53 1.03 1.53 1.03.87 1.52 2.34 1.07 2.91.83.09-.65.35-1.09.63-1.34-2.22-.25-4.55-1.11-4.55-4.92 0-1.11.38-2 1.03-2.71-.1-.25-.45-1.29.1-2.64 0 0 .84-.27 2.75 1.02.79-.22 1.65-.33 2.5-.33.85 0 1.71.11 2.5.33 1.91-1.29 2.75-1.02 2.75-1.02.55 1.35.2 2.39.1 2.64.65.71 1.03 1.6 1.03 2.71 0 3.82-2.34 4.66-4.57 4.91.36.31.69.92.69 1.85V21c0 .27.16.59.67.5C19.14 20.16 22 16.42 22 12A10 10 0 0 0 12 2Z"/></svg>
75813+
</span>
75814+
<span>GitHub</span>
75815+
75816+
75817+
<nav>
75818+
75819+
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
75820+
75821+
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
75822+
</a>
75823+
75824+
<a href="https://github.com/thinkasany" class="md-author" title="@thinkasany">
75825+
75826+
<img src="https://avatars.githubusercontent.com/u/117748716?v=4&size=72" alt="thinkasany">
75827+
</a>
75828+
75829+
75830+
75831+
</nav>
75832+
</span>
75833+
75834+
75835+
</aside>
75836+
7580275837

7580375838

7580475839

‎lcof/3/index.html

Lines changed: 31 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -80286,7 +80286,7 @@ <h2 id="_2">解法</h2>
8028680286
<h3 id="_3">方法一：排序</h3>
8028780287
<p>我们可以先对数组 <code>nums</code> 进行排序，然后遍历排序后的数组，判断相邻的两个元素是否相等，如果相等，即找到了一个重复的数字，返回该数字即可。</p>
8028880288
<p>时间复杂度 $O(n \times \log n)$，空间复杂度 $O(\log n)$。其中 $n$ 是数组 <code>nums</code> 的长度。</p>
80289-
<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">Kotlin</label></div>
80289+
<div class="tabbed-set tabbed-alternate" data-tabs="1:10"><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" /><input id="__tabbed_1_10" 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">Kotlin</label><label for="__tabbed_1_10">Swift</label></div>
8029080290
<div class="tabbed-content">
8029180291
<div class="tabbed-block">
8029280292
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
@@ -80522,6 +80522,30 @@ <h3 id="_3">方法一：排序</h3>
8052280522
<span class="p">}</span>
8052380523
</code></pre></div></td></tr></table></div>
8052480524
</div>
80525+
<div class="tabbed-block">
80526+
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
80527+
<span class="normal"> 2</span>
80528+
<span class="normal"> 3</span>
80529+
<span class="normal"> 4</span>
80530+
<span class="normal"> 5</span>
80531+
<span class="normal"> 6</span>
80532+
<span class="normal"> 7</span>
80533+
<span class="normal"> 8</span>
80534+
<span class="normal"> 9</span>
80535+
<span class="normal">10</span>
80536+
<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="p">{</span>
80537+
<span class="kd">func</span> <span class="nf">findRepeatNumber</span><span class="p">(</span><span class="kc">_</span> <span class="n">nums</span><span class="p">:</span> <span class="p">[</span><span class="nb">Int</span><span class="p">])</span> <span class="p">-&gt;</span> <span class="nb">Int</span> <span class="p">{</span>
80538+
<span class="kd">let</span> <span class="nv">sortedNums</span> <span class="p">=</span> <span class="n">nums</span><span class="p">.</span><span class="bp">sorted</span><span class="p">()</span>
80539+
<span class="k">for</span> <span class="n">i</span> <span class="k">in</span> <span class="mf">0.</span><span class="p">.&lt;</span><span class="n">sortedNums</span><span class="p">.</span><span class="bp">count</span> <span class="o">-</span> <span class="mi">1</span> <span class="p">{</span>
80540+
<span class="k">if</span> <span class="n">sortedNums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="p">==</span> <span class="n">sortedNums</span><span class="p">[</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">]</span> <span class="p">{</span>
80541+
<span class="k">return</span> <span class="n">sortedNums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
80542+
<span class="p">}</span>
80543+
<span class="p">}</span>
80544+
<span class="k">return</span> <span class="o">-</span><span class="mi">1</span>
80545+
<span class="p">}</span>
80546+
<span class="p">}</span>
80547+
</code></pre></div></td></tr></table></div>
80548+
</div>
8052580549
</div>
8052680550
</div>
8052780551
<!-- solution:end -->
@@ -80765,6 +80789,11 @@ <h3 id="_5">方法三：原地交换</h3>
8076580789

8076680790
<nav>
8076780791

80792+
<a href="https://github.com/klever34" class="md-author" title="@klever34">
80793+
80794+
<img src="https://avatars.githubusercontent.com/u/12745225?v=4&size=72" alt="klever34">
80795+
</a>
80796+
8076880797
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
8076980798

8077080799
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
@@ -80780,16 +80809,11 @@ <h3 id="_5">方法三：原地交换</h3>
8078080809
<img src="https://avatars.githubusercontent.com/u/70502828?v=4&size=72" alt="YangFong">
8078180810
</a>
8078280811

80783-
<a href="https://github.com/maolonglong" class="md-author" title="@maolonglong">
80784-
80785-
<img src="https://avatars.githubusercontent.com/u/50797868?v=4&size=72" alt="maolonglong">
80786-
</a>
80787-
8078880812

8078980813

8079080814

8079180815
<a href="https://github.com/doocs/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9803.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md" class="md-author md-author--more">
80792-
+5
80816+
+6
8079380817
</a>
8079480818

8079580819

‎lcof/4/index.html

Lines changed: 29 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -80294,7 +80294,7 @@ <h3 id="_3">方法一：二分查找</h3>
8029480294
<p>由于每一行的所有元素升序排列，因此，对于每一行，我们可以使用二分查找找到第一个大于等于 <code>target</code> 的元素，然后判断该元素是否等于 <code>target</code>。如果等于 <code>target</code>，说明找到了目标值，直接返回 <code>true</code>。如果不等于 <code>target</code>，说明这一行的所有元素都小于 <code>target</code>，应该继续搜索下一行。</p>
8029580295
<p>如果所有行都搜索完了，都没有找到目标值，说明目标值不存在，返回 <code>false</code>。</p>
8029680296
<p>时间复杂度 $O(m \times \log n)$，空间复杂度 $O(1)$。其中 $m$ 和 $n$ 分别为矩阵的行数和列数。</p>
80297-
<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>
80297+
<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>
8029880298
<div class="tabbed-content">
8029980299
<div class="tabbed-block">
8030080300
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
@@ -80556,6 +80556,28 @@ <h3 id="_3">方法一：二分查找</h3>
8055680556
<span class="p">}</span>
8055780557
</code></pre></div></td></tr></table></div>
8055880558
</div>
80559+
<div class="tabbed-block">
80560+
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
80561+
<span class="normal"> 2</span>
80562+
<span class="normal"> 3</span>
80563+
<span class="normal"> 4</span>
80564+
<span class="normal"> 5</span>
80565+
<span class="normal"> 6</span>
80566+
<span class="normal"> 7</span>
80567+
<span class="normal"> 8</span>
80568+
<span class="normal"> 9</span>
80569+
<span class="normal">10</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="kd">class</span> <span class="nc">Solution</span> <span class="p">{</span>
80570+
<span class="kd">func</span> <span class="nf">findNumberIn2DArray</span><span class="p">(</span><span class="kc">_</span> <span class="n">matrix</span><span class="p">:</span> <span class="p">[[</span><span class="nb">Int</span><span class="p">]],</span> <span class="kc">_</span> <span class="n">target</span><span class="p">:</span> <span class="nb">Int</span><span class="p">)</span> <span class="p">-&gt;</span> <span class="nb">Bool</span> <span class="p">{</span>
80571+
<span class="k">for</span> <span class="n">row</span> <span class="k">in</span> <span class="n">matrix</span> <span class="p">{</span>
80572+
<span class="k">if</span> <span class="kd">let</span> <span class="nv">_</span> <span class="p">=</span> <span class="n">row</span><span class="p">.</span><span class="n">firstIndex</span><span class="p">(</span><span class="n">of</span><span class="p">:</span> <span class="n">target</span><span class="p">)</span> <span class="p">{</span>
80573+
<span class="k">return</span> <span class="kc">true</span>
80574+
<span class="p">}</span>
80575+
<span class="p">}</span>
80576+
<span class="k">return</span> <span class="kc">false</span>
80577+
<span class="p">}</span>
80578+
<span class="p">}</span>
80579+
</code></pre></div></td></tr></table></div>
80580+
</div>
8055980581
</div>
8056080582
</div>
8056180583
<!-- solution:end -->
@@ -80754,6 +80776,11 @@ <h3 id="_4">方法二：从左下角或右上角搜索</h3>
8075480776

8075580777
<nav>
8075680778

80779+
<a href="https://github.com/klever34" class="md-author" title="@klever34">
80780+
80781+
<img src="https://avatars.githubusercontent.com/u/12745225?v=4&size=72" alt="klever34">
80782+
</a>
80783+
8075780784
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
8075880785

8075980786
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
@@ -80769,16 +80796,11 @@ <h3 id="_4">方法二：从左下角或右上角搜索</h3>
8076980796
<img src="https://avatars.githubusercontent.com/u/70502828?v=4&size=72" alt="YangFong">
8077080797
</a>
8077180798

80772-
<a href="https://github.com/zhaocchen" class="md-author" title="@zhaocchen">
80773-
80774-
<img src="https://avatars.githubusercontent.com/u/22462923?v=4&size=72" alt="zhaocchen">
80775-
</a>
80776-
8077780799

8077880800

8077980801

8078080802
<a href="https://github.com/doocs/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/README.md" class="md-author md-author--more">
80781-
+3
80803+
+4
8078280804
</a>
8078380805

8078480806

‎search/search_index.json

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

‎stylesheets/extra.css

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,15 @@
44
.md-typeset h2 {
55
margin: 0.5em 0 0em;
66
}
7+
.md-typeset .example-block {
8+
overflow-x: auto;
9+
padding: 0 .2941176471em;
10+
background-color: #f5f5f5;
11+
border-radius: .1rem;
12+
}
13+
.md-typeset .example-block p {
14+
margin: 0;
15+
}
716
.md-content__inner>pre {
817
margin: 0;
918
overflow-x: auto;

0 commit comments

Comments
 (0)