algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 20:52:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-02-07 17:17:25 +08:00
parent 1ca5c731f7
commit 95bffcfb36
21 changed files with 857 additions and 548 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
site/chapter_array_and_linkedlist/array/index.html
View File

@@ -1676,9 +1676,10 @@
<a id="__codelineno-11-3" name="__codelineno-11-3" href="#__codelineno-11-3"></a><span class="w"> </span><span class="c1">// 在区间 [0, nums.length) 中随机抽取一个数字</span>
<a id="__codelineno-11-4" name="__codelineno-11-4" href="#__codelineno-11-4"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">randomIndex</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ThreadLocalRandom</span><span class="p">.</span><span class="na">current</span><span class="p">().</span>
<a id="__codelineno-11-5" name="__codelineno-11-5" href="#__codelineno-11-5"></a><span class="w"> </span><span class="n">nextInt</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">nums</span><span class="p">.</span><span class="na">length</span><span class="p">);</span>
<a id="__codelineno-11-6" name="__codelineno-11-6" href="#__codelineno-11-6"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">randomNum</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">[</span><span class="n">randomIndex</span><span class="o">]</span><span class="p">;</span>
<a id="__codelineno-11-7" name="__codelineno-11-7" href="#__codelineno-11-7"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">randomNum</span><span class="p">;</span>
<a id="__codelineno-11-8" name="__codelineno-11-8" href="#__codelineno-11-8"></a><span class="p">}</span>
<a id="__codelineno-11-6" name="__codelineno-11-6" href="#__codelineno-11-6"></a><span class="w"> </span><span class="c1">// 获取并返回随机元素</span>
<a id="__codelineno-11-7" name="__codelineno-11-7" href="#__codelineno-11-7"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">randomNum</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">[</span><span class="n">randomIndex</span><span class="o">]</span><span class="p">;</span>
<a id="__codelineno-11-8" name="__codelineno-11-8" href="#__codelineno-11-8"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">randomNum</span><span class="p">;</span>
<a id="__codelineno-11-9" name="__codelineno-11-9" href="#__codelineno-11-9"></a><span class="p">}</span>
</code></pre></div>
</div>
<div class="tabbed-block">

13
site/chapter_array_and_linkedlist/list/index.html
View File

@@ -2246,7 +2246,18 @@
<a id="__codelineno-60-83" name="__codelineno-60-83" href="#__codelineno-60-83"></a><span class="w"> </span><span class="c1">// 更新列表容量</span>
<a id="__codelineno-60-84" name="__codelineno-60-84" href="#__codelineno-60-84"></a><span class="w"> </span><span class="n">capacity</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="p">.</span><span class="na">length</span><span class="p">;</span>
<a id="__codelineno-60-85" name="__codelineno-60-85" href="#__codelineno-60-85"></a><span class="w"> </span><span class="p">}</span>
<a id="__codelineno-60-86" name="__codelineno-60-86" href="#__codelineno-60-86"></a><span class="p">}</span>
<a id="__codelineno-60-86" name="__codelineno-60-86" href="#__codelineno-60-86"></a>
<a id="__codelineno-60-87" name="__codelineno-60-87" href="#__codelineno-60-87"></a><span class="w"> </span><span class="cm">/* 将列表转换为数组 */</span>
<a id="__codelineno-60-88" name="__codelineno-60-88" href="#__codelineno-60-88"></a><span class="w"> </span><span class="kd">public</span><span class="w"> </span><span class="kt">int</span><span class="o">[]</span><span class="w"> </span><span class="nf">toArray</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-60-89" name="__codelineno-60-89" href="#__codelineno-60-89"></a><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">size</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">();</span>
<a id="__codelineno-60-90" name="__codelineno-60-90" href="#__codelineno-60-90"></a><span class="w"> </span><span class="c1">// 仅转换有效长度范围内的列表元素</span>
<a id="__codelineno-60-91" name="__codelineno-60-91" href="#__codelineno-60-91"></a><span class="w"> </span><span class="kt">int</span><span class="o">[]</span><span class="w"> </span><span class="n">nums</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="kt">int</span><span class="o">[</span><span class="n">size</span><span class="o">]</span><span class="p">;</span>
<a id="__codelineno-60-92" name="__codelineno-60-92" href="#__codelineno-60-92"></a><span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">size</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-60-93" name="__codelineno-60-93" href="#__codelineno-60-93"></a><span class="w"> </span><span class="n">nums</span><span class="o">[</span><span class="n">i</span><span class="o">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">get</span><span class="p">(</span><span class="n">i</span><span class="p">);</span>
<a id="__codelineno-60-94" name="__codelineno-60-94" href="#__codelineno-60-94"></a><span class="w"> </span><span class="p">}</span>
<a id="__codelineno-60-95" name="__codelineno-60-95" href="#__codelineno-60-95"></a><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">nums</span><span class="p">;</span>
<a id="__codelineno-60-96" name="__codelineno-60-96" href="#__codelineno-60-96"></a><span class="w"> </span><span class="p">}</span>
<a id="__codelineno-60-97" name="__codelineno-60-97" href="#__codelineno-60-97"></a><span class="p">}</span>
</code></pre></div>
</div>
<div class="tabbed-block">