@@ -80406,7 +80406,7 @@ <h3 id="_3">方法一:模拟</h3>
80406
80406
<p>直接根据题意模拟即可。</p>
80407
80407
<p>时间复杂度 $O(10^n)$,空间复杂度 $O(1)$。</p>
80408
80408
<p>如果 $n$ 的值比较大,那么直接使用整数会溢出,因此可以使用字符串来模拟,参考以下代码中的 <code>print()</code> 函数。</p>
80409
- <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">JavaScript</label><label for="__tabbed_1_6">C#</label></div>
80409
+ <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">JavaScript</label><label for="__tabbed_1_6">C#</label><label for="__tabbed_1_7">Swift </label></div>
80410
80410
<div class="tabbed-content">
80411
80411
<div class="tabbed-block">
80412
80412
<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
@@ -80694,6 +80694,82 @@ <h3 id="_3">方法一:模拟</h3>
80694
80694
<span class="p">}</span>
80695
80695
</code></pre></div></td></tr></table></div>
80696
80696
</div>
80697
+ <div class="tabbed-block">
80698
+ <div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
80699
+ <span class="normal"> 2</span>
80700
+ <span class="normal"> 3</span>
80701
+ <span class="normal"> 4</span>
80702
+ <span class="normal"> 5</span>
80703
+ <span class="normal"> 6</span>
80704
+ <span class="normal"> 7</span>
80705
+ <span class="normal"> 8</span>
80706
+ <span class="normal"> 9</span>
80707
+ <span class="normal">10</span>
80708
+ <span class="normal">11</span>
80709
+ <span class="normal">12</span>
80710
+ <span class="normal">13</span>
80711
+ <span class="normal">14</span>
80712
+ <span class="normal">15</span>
80713
+ <span class="normal">16</span>
80714
+ <span class="normal">17</span>
80715
+ <span class="normal">18</span>
80716
+ <span class="normal">19</span>
80717
+ <span class="normal">20</span>
80718
+ <span class="normal">21</span>
80719
+ <span class="normal">22</span>
80720
+ <span class="normal">23</span>
80721
+ <span class="normal">24</span>
80722
+ <span class="normal">25</span>
80723
+ <span class="normal">26</span>
80724
+ <span class="normal">27</span>
80725
+ <span class="normal">28</span>
80726
+ <span class="normal">29</span>
80727
+ <span class="normal">30</span>
80728
+ <span class="normal">31</span>
80729
+ <span class="normal">32</span>
80730
+ <span class="normal">33</span>
80731
+ <span class="normal">34</span>
80732
+ <span class="normal">35</span>
80733
+ <span class="normal">36</span>
80734
+ <span class="normal">37</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>
80735
+ <span class="kd">func</span> <span class="nf">printNumbers</span><span class="p">(</span><span class="kc">_</span> <span class="n">n</span><span class="p">:</span> <span class="nb">Int</span><span class="p">)</span> <span class="p">-></span> <span class="p">[</span><span class="nb">Int</span><span class="p">]</span> <span class="p">{</span>
80736
+ <span class="kd">let</span> <span class="nv">maxNumber</span> <span class="p">=</span> <span class="n">maxNumberForDigits</span><span class="p">(</span><span class="n">n</span><span class="p">)</span>
80737
+ <span class="k">return</span> <span class="nb">Array</span><span class="p">(</span><span class="mf">1.</span><span class="p">..</span><span class="n">maxNumber</span><span class="p">)</span>
80738
+ <span class="p">}</span>
80739
+
80740
+ <span class="kd">private</span> <span class="kd">func</span> <span class="nf">maxNumberForDigits</span><span class="p">(</span><span class="kc">_</span> <span class="n">n</span><span class="p">:</span> <span class="nb">Int</span><span class="p">)</span> <span class="p">-></span> <span class="nb">Int</span> <span class="p">{</span>
80741
+ <span class="kd">var</span> <span class="nv">maxNumber</span> <span class="p">=</span> <span class="mi">1</span>
80742
+ <span class="k">for</span> <span class="kc">_</span> <span class="k">in</span> <span class="mf">0.</span><span class="p">.<</span><span class="n">n</span> <span class="p">{</span>
80743
+ <span class="n">maxNumber</span> <span class="o">*=</span> <span class="mi">10</span>
80744
+ <span class="p">}</span>
80745
+ <span class="k">return</span> <span class="n">maxNumber</span> <span class="o">-</span> <span class="mi">1</span>
80746
+ <span class="p">}</span>
80747
+
80748
+ <span class="kd">private</span> <span class="kd">var</span> <span class="nv">s</span> <span class="p">=</span> <span class="nb">String</span><span class="p">()</span>
80749
+ <span class="kd">private</span> <span class="kd">var</span> <span class="nv">ans</span> <span class="p">=</span> <span class="p">[</span><span class="nb">String</span><span class="p">]()</span>
80750
+
80751
+ <span class="kd">func</span> <span class="nf">print</span><span class="p">(</span><span class="kc">_</span> <span class="n">n</span><span class="p">:</span> <span class="nb">Int</span><span class="p">)</span> <span class="p">-></span> <span class="p">[</span><span class="nb">String</span><span class="p">]</span> <span class="p">{</span>
80752
+ <span class="k">for</span> <span class="n">i</span> <span class="k">in</span> <span class="mf">1.</span><span class="p">..</span><span class="n">n</span> <span class="p">{</span>
80753
+ <span class="n">dfs</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">i</span><span class="p">)</span>
80754
+ <span class="p">}</span>
80755
+ <span class="k">return</span> <span class="n">ans</span>
80756
+ <span class="p">}</span>
80757
+
80758
+ <span class="kd">private</span> <span class="kd">func</span> <span class="nf">dfs</span><span class="p">(</span><span class="kc">_</span> <span class="n">i</span><span class="p">:</span> <span class="nb">Int</span><span class="p">,</span> <span class="kc">_</span> <span class="n">j</span><span class="p">:</span> <span class="nb">Int</span><span class="p">)</span> <span class="p">{</span>
80759
+ <span class="k">if</span> <span class="n">i</span> <span class="p">==</span> <span class="n">j</span> <span class="p">{</span>
80760
+ <span class="n">ans</span><span class="p">.</span><span class="n">append</span><span class="p">(</span><span class="n">s</span><span class="p">)</span>
80761
+ <span class="k">return</span>
80762
+ <span class="p">}</span>
80763
+ <span class="kd">let</span> <span class="nv">start</span> <span class="p">=</span> <span class="n">i</span> <span class="o">></span> <span class="mi">0</span> <span class="p">?</span> <span class="mi">0</span> <span class="p">:</span> <span class="mi">1</span>
80764
+ <span class="k">for</span> <span class="n">k</span> <span class="k">in</span> <span class="n">start</span><span class="p">..<</span><span class="mi">10</span> <span class="p">{</span>
80765
+ <span class="n">s</span><span class="p">.</span><span class="n">append</span><span class="p">(</span><span class="s">"</span><span class="si">\(</span><span class="n">k</span><span class="si">)</span><span class="s">"</span><span class="p">)</span>
80766
+ <span class="n">dfs</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="n">j</span><span class="p">)</span>
80767
+ <span class="n">s</span><span class="p">.</span><span class="bp">removeLast</span><span class="p">()</span>
80768
+ <span class="p">}</span>
80769
+ <span class="p">}</span>
80770
+ <span class="p">}</span>
80771
+ </code></pre></div></td></tr></table></div>
80772
+ </div>
80697
80773
</div>
80698
80774
</div>
80699
80775
<!-- solution:end -->
@@ -80727,6 +80803,11 @@ <h3 id="_3">方法一:模拟</h3>
80727
80803
80728
80804
<nav>
80729
80805
80806
+ <a href="https://github.com/klever34" class="md-author" title="@klever34">
80807
+
80808
+ <img src="https://avatars.githubusercontent.com/u/12745225?v=4&size=72" alt="klever34">
80809
+ </a>
80810
+
80730
80811
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
80731
80812
80732
80813
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
@@ -80742,16 +80823,11 @@ <h3 id="_3">方法一:模拟</h3>
80742
80823
<img src="https://avatars.githubusercontent.com/u/50797868?v=4&size=72" alt="maolonglong">
80743
80824
</a>
80744
80825
80745
- <a href="https://github.com/hzliangbin" class="md-author" title="@hzliangbin">
80746
-
80747
- <img src="https://avatars.githubusercontent.com/u/9740458?v=4&size=72" alt="hzliangbin">
80748
- </a>
80749
-
80750
80826
80751
80827
80752
80828
80753
80829
<a href="https://github.com/doocs/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0/README.md" class="md-author md-author--more">
80754
- +1
80830
+ +2
80755
80831
</a>
80756
80832
80757
80833
0 commit comments