Skip to content

Commit f815fa9

Browse files
committed
deploy: 06533ad
1 parent 80b1de7 commit f815fa9

File tree

6 files changed

+138
-32
lines changed

6 files changed

+138
-32
lines changed

en/lc/1317/index.html

Lines changed: 64 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -34495,18 +34495,18 @@
3449534495
<ul class="md-nav__list">
3449634496

3449734497
<li class="md-nav__item">
34498-
<a href="#solution-1" class="md-nav__link">
34498+
<a href="#solution-1-direct-enumeration" class="md-nav__link">
3449934499
<span class="md-ellipsis">
34500-
Solution 1
34500+
Solution 1: Direct Enumeration
3450134501
</span>
3450234502
</a>
3450334503

3450434504
</li>
3450534505

3450634506
<li class="md-nav__item">
34507-
<a href="#solution-2" class="md-nav__link">
34507+
<a href="#solution-2-direct-enumeration-alternative-approach" class="md-nav__link">
3450834508
<span class="md-ellipsis">
34509-
Solution 2
34509+
Solution 2: Direct Enumeration (Alternative Approach)
3451034510
</span>
3451134511
</a>
3451234512

@@ -75820,8 +75820,10 @@ <h2 id="description">Description</h2>
7582075820
<h2 id="solutions">Solutions</h2>
7582175821
<!-- solution:start -->
7582275822

75823-
<h3 id="solution-1">Solution 1</h3>
75824-
<div class="tabbed-set tabbed-alternate" data-tabs="1:4"><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" /><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></div>
75823+
<h3 id="solution-1-direct-enumeration">Solution 1: Direct Enumeration</h3>
75824+
<p>Starting from $1$, we enumerate $a$, then $b = n - a$. For each $a$ and $b$, we convert them to strings and concatenate them, then check if they contain the character '0'. If they do not contain '0', we have found the answer and return $[a, b]$.</p>
75825+
<p>The time complexity is $O(n \times \log n)$, where $n$ is the integer given in the problem. The space complexity is $O(\log n)$.</p>
75826+
<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>
7582575827
<div class="tabbed-content">
7582675828
<div class="tabbed-block">
7582775829
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
@@ -75901,14 +75903,34 @@ <h3 id="solution-1">Solution 1</h3>
7590175903
<span class="p">}</span>
7590275904
</code></pre></div></td></tr></table></div>
7590375905
</div>
75906+
<div class="tabbed-block">
75907+
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
75908+
<span class="normal">2</span>
75909+
<span class="normal">3</span>
75910+
<span class="normal">4</span>
75911+
<span class="normal">5</span>
75912+
<span class="normal">6</span>
75913+
<span class="normal">7</span>
75914+
<span class="normal">8</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="kd">function</span><span class="w"> </span><span class="nx">getNoZeroIntegers</span><span class="p">(</span><span class="nx">n</span><span class="o">:</span><span class="w"> </span><span class="kt">number</span><span class="p">)</span><span class="o">:</span><span class="w"> </span><span class="kt">number</span><span class="p">[]</span><span class="w"> </span><span class="p">{</span>
75915+
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kd">let</span><span class="w"> </span><span class="nx">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1</span><span class="p">;</span><span class="w"> </span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="nx">a</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
75916+
<span class="w"> </span><span class="kd">const</span><span class="w"> </span><span class="nx">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nx">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nx">a</span><span class="p">;</span>
75917+
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="sb">`</span><span class="si">${</span><span class="nx">a</span><span class="si">}${</span><span class="nx">b</span><span class="si">}</span><span class="sb">`</span><span class="p">.</span><span class="nx">includes</span><span class="p">(</span><span class="s1">&#39;0&#39;</span><span class="p">))</span><span class="w"> </span><span class="p">{</span>
75918+
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="p">[</span><span class="nx">a</span><span class="p">,</span><span class="w"> </span><span class="nx">b</span><span class="p">];</span>
75919+
<span class="w"> </span><span class="p">}</span>
75920+
<span class="w"> </span><span class="p">}</span>
75921+
<span class="p">}</span>
75922+
</code></pre></div></td></tr></table></div>
75923+
</div>
7590475924
</div>
7590575925
</div>
7590675926
<!-- solution:end -->
7590775927

7590875928
<!-- solution:start -->
7590975929

75910-
<h3 id="solution-2">Solution 2</h3>
75911-
<div class="tabbed-set tabbed-alternate" data-tabs="2:4"><input checked="checked" id="__tabbed_2_1" name="__tabbed_2" type="radio" /><input id="__tabbed_2_2" name="__tabbed_2" type="radio" /><input id="__tabbed_2_3" name="__tabbed_2" type="radio" /><input id="__tabbed_2_4" name="__tabbed_2" type="radio" /><div class="tabbed-labels"><label for="__tabbed_2_1">Python3</label><label for="__tabbed_2_2">Java</label><label for="__tabbed_2_3">C++</label><label for="__tabbed_2_4">Go</label></div>
75930+
<h3 id="solution-2-direct-enumeration-alternative-approach">Solution 2: Direct Enumeration (Alternative Approach)</h3>
75931+
<p>In Solution 1, we converted $a$ and $b$ into strings and concatenated them, then checked if they contained the character '0'. Here, we can use a function $f(x)$ to check whether $x$ contains the character '0', and then directly enumerate $a$, checking whether both $a$ and $b = n - a$ do not contain the character '0'. If they do not, we have found the answer and return $[a, b]$.</p>
75932+
<p>The time complexity is $O(n \times \log n)$, where $n$ is the integer given in the problem. The space complexity is $O(1)$.</p>
75933+
<div class="tabbed-set tabbed-alternate" data-tabs="2:5"><input checked="checked" id="__tabbed_2_1" name="__tabbed_2" type="radio" /><input id="__tabbed_2_2" name="__tabbed_2" type="radio" /><input id="__tabbed_2_3" name="__tabbed_2" type="radio" /><input id="__tabbed_2_4" name="__tabbed_2" type="radio" /><input id="__tabbed_2_5" name="__tabbed_2" type="radio" /><div class="tabbed-labels"><label for="__tabbed_2_1">Python3</label><label for="__tabbed_2_2">Java</label><label for="__tabbed_2_3">C++</label><label for="__tabbed_2_4">Go</label><label for="__tabbed_2_5">TypeScript</label></div>
7591275934
<div class="tabbed-content">
7591375935
<div class="tabbed-block">
7591475936
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
@@ -76052,6 +76074,40 @@ <h3 id="solution-2">Solution 2</h3>
7605276074
<span class="p">}</span>
7605376075
</code></pre></div></td></tr></table></div>
7605476076
</div>
76077+
<div class="tabbed-block">
76078+
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
76079+
<span class="normal"> 2</span>
76080+
<span class="normal"> 3</span>
76081+
<span class="normal"> 4</span>
76082+
<span class="normal"> 5</span>
76083+
<span class="normal"> 6</span>
76084+
<span class="normal"> 7</span>
76085+
<span class="normal"> 8</span>
76086+
<span class="normal"> 9</span>
76087+
<span class="normal">10</span>
76088+
<span class="normal">11</span>
76089+
<span class="normal">12</span>
76090+
<span class="normal">13</span>
76091+
<span class="normal">14</span>
76092+
<span class="normal">15</span>
76093+
<span class="normal">16</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="kd">function</span><span class="w"> </span><span class="nx">getNoZeroIntegers</span><span class="p">(</span><span class="nx">n</span><span class="o">:</span><span class="w"> </span><span class="kt">number</span><span class="p">)</span><span class="o">:</span><span class="w"> </span><span class="kt">number</span><span class="p">[]</span><span class="w"> </span><span class="p">{</span>
76094+
<span class="w"> </span><span class="kd">const</span><span class="w"> </span><span class="nx">f</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="nx">x</span><span class="o">:</span><span class="w"> </span><span class="kt">number</span><span class="p">)</span><span class="o">:</span><span class="w"> </span><span class="kt">boolean</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="p">{</span>
76095+
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(;</span><span class="w"> </span><span class="nx">x</span><span class="p">;</span><span class="w"> </span><span class="nx">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="nx">x</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">10</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mf">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
76096+
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nx">x</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mf">10</span><span class="w"> </span><span class="o">===</span><span class="w"> </span><span class="mf">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
76097+
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="kc">false</span><span class="p">;</span>
76098+
<span class="w"> </span><span class="p">}</span>
76099+
<span class="w"> </span><span class="p">}</span>
76100+
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="kc">true</span><span class="p">;</span>
76101+
<span class="w"> </span><span class="p">};</span>
76102+
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kd">let</span><span class="w"> </span><span class="nx">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1</span><span class="p">;</span><span class="w"> </span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="nx">a</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
76103+
<span class="w"> </span><span class="kd">const</span><span class="w"> </span><span class="nx">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nx">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nx">a</span><span class="p">;</span>
76104+
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nx">f</span><span class="p">(</span><span class="nx">a</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="nx">f</span><span class="p">(</span><span class="nx">b</span><span class="p">))</span><span class="w"> </span><span class="p">{</span>
76105+
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="p">[</span><span class="nx">a</span><span class="p">,</span><span class="w"> </span><span class="nx">b</span><span class="p">];</span>
76106+
<span class="w"> </span><span class="p">}</span>
76107+
<span class="w"> </span><span class="p">}</span>
76108+
<span class="p">}</span>
76109+
</code></pre></div></td></tr></table></div>
76110+
</div>
7605576111
</div>
7605676112
</div>
7605776113
<!-- solution:end -->

en/lc/3068/index.html

Lines changed: 6 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -75903,11 +75903,9 @@ <h3 id="solution-1">Solution 1</h3>
7590375903
<span class="normal">25</span>
7590475904
<span class="normal">26</span>
7590575905
<span class="normal">27</span>
75906-
<span class="normal">28</span>
75907-
<span class="normal">29</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span><span class="w"> </span><span class="nc">Solution</span><span class="w"> </span><span class="p">{</span>
75906+
<span class="normal">28</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span><span class="w"> </span><span class="nc">Solution</span><span class="w"> </span><span class="p">{</span>
7590875907
<span class="k">public</span><span class="o">:</span>
75909-
<span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="n">maximumValueSum</span><span class="p">(</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">nums</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">k</span><span class="p">,</span>
75910-
<span class="w"> </span><span class="n">vector</span><span class="o">&lt;</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;&gt;&amp;</span><span class="w"> </span><span class="n">edges</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
75908+
<span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="n">maximumValueSum</span><span class="p">(</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;&amp;</span><span class="w"> </span><span class="n">nums</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">vector</span><span class="o">&lt;</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;&gt;&amp;</span><span class="w"> </span><span class="n">edges</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
7591175909
<span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="n">totalSum</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
7591275910
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
7591375911
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">positiveMin</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">INT_MAX</span><span class="p">;</span>
@@ -75972,14 +75970,14 @@ <h3 id="solution-1">Solution 1</h3>
7597275970

7597375971
<nav>
7597475972

75975-
<a href="https://github.com/AliPythonDev" class="md-author" title="@AliPythonDev">
75973+
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
7597675974

75977-
<img src="https://avatars.githubusercontent.com/u/110383490?v=4&size=72" alt="AliPythonDev">
75975+
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
7597875976
</a>
7597975977

75980-
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
75978+
<a href="https://github.com/AliPythonDev" class="md-author" title="@AliPythonDev">
7598175979

75982-
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
75980+
<img src="https://avatars.githubusercontent.com/u/110383490?v=4&size=72" alt="AliPythonDev">
7598375981
</a>
7598475982

7598575983

en/search/search_index.json

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

0 commit comments

Comments
 (0)