This commit is contained in:
krahets
2023-06-02 02:59:04 +08:00
parent 12dcc5c813
commit e4a6610af8
7 changed files with 221 additions and 16 deletions

View File

@@ -4943,8 +4943,9 @@ n! = n \times (n - 1) \times (n - 2) \times \cdots \times 2 \times 1
<a id="__codelineno-175-18" name="__codelineno-175-18" href="#__codelineno-175-18"></a><span class="w"> </span><span class="c1">// 当元素 1 在数组尾部时,达到最差时间复杂度 O(n)</span>
<a id="__codelineno-175-19" name="__codelineno-175-19" href="#__codelineno-175-19"></a><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="m">1</span><span class="p">)</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">i</span><span class="p">;</span>
<a id="__codelineno-175-20" name="__codelineno-175-20" href="#__codelineno-175-20"></a><span class="w"> </span><span class="p">}</span>
<a id="__codelineno-175-21" name="__codelineno-175-21" href="#__codelineno-175-21"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="o">-</span><span class="m">1</span><span class="p">;</span>
<a id="__codelineno-175-22" name="__codelineno-175-22" href="#__codelineno-175-22"></a><span class="p">}</span>
<a id="__codelineno-175-21" name="__codelineno-175-21" href="#__codelineno-175-21"></a>
<a id="__codelineno-175-22" name="__codelineno-175-22" href="#__codelineno-175-22"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="o">-</span><span class="m">1</span><span class="p">;</span>
<a id="__codelineno-175-23" name="__codelineno-175-23" href="#__codelineno-175-23"></a><span class="p">}</span>
</code></pre></div>
</div>
</div>