deploy

chapter_greedy/fractional_knapsack_problem/index.html

@@ -3842,7 +3842,7 @@
 <a id="__codelineno-5-14" name="__codelineno-5-14" href="#__codelineno-5-14"></a>    <span class="c1">// 创建物品列表，包含两个属性：重量、价值</span>
 <a id="__codelineno-5-15" name="__codelineno-5-15" href="#__codelineno-5-15"></a>    <span class="kd">var</span> <span class="nv">items</span> <span class="p">=</span> <span class="n">zip</span><span class="p">(</span><span class="n">wgt</span><span class="p">,</span> <span class="n">val</span><span class="p">).</span><span class="bp">map</span> <span class="p">{</span> <span class="n">Item</span><span class="p">(</span><span class="n">w</span><span class="p">:</span> <span class="nv">$0</span><span class="p">,</span> <span class="n">v</span><span class="p">:</span> <span class="nv">$1</span><span class="p">)</span> <span class="p">}</span>
 <a id="__codelineno-5-16" name="__codelineno-5-16" href="#__codelineno-5-16"></a>    <span class="c1">// 按照单位价值 item.v / item.w 从高到低进行排序</span>
-<a id="__codelineno-5-17" name="__codelineno-5-17" href="#__codelineno-5-17"></a>    <span class="n">items</span><span class="p">.</span><span class="bp">sort</span><span class="p">(</span><span class="n">by</span><span class="p">:</span> <span class="p">{</span> <span class="o">-</span><span class="p">(</span><span class="nb">Double</span><span class="p">(</span><span class="nv">$0</span><span class="p">.</span><span class="n">v</span><span class="p">)</span> <span class="o">/</span> <span class="nb">Double</span><span class="p">(</span><span class="nv">$0</span><span class="p">.</span><span class="n">w</span><span class="p">))</span> <span class="o">&lt;</span> <span class="o">-</span><span class="p">(</span><span class="nb">Double</span><span class="p">(</span><span class="nv">$1</span><span class="p">.</span><span class="n">v</span><span class="p">)</span> <span class="o">/</span> <span class="nb">Double</span><span class="p">(</span><span class="nv">$1</span><span class="p">.</span><span class="n">w</span><span class="p">))</span> <span class="p">})</span>
+<a id="__codelineno-5-17" name="__codelineno-5-17" href="#__codelineno-5-17"></a>    <span class="n">items</span><span class="p">.</span><span class="bp">sort</span> <span class="p">{</span> <span class="o">-</span><span class="p">(</span><span class="nb">Double</span><span class="p">(</span><span class="nv">$0</span><span class="p">.</span><span class="n">v</span><span class="p">)</span> <span class="o">/</span> <span class="nb">Double</span><span class="p">(</span><span class="nv">$0</span><span class="p">.</span><span class="n">w</span><span class="p">))</span> <span class="o">&lt;</span> <span class="o">-</span><span class="p">(</span><span class="nb">Double</span><span class="p">(</span><span class="nv">$1</span><span class="p">.</span><span class="n">v</span><span class="p">)</span> <span class="o">/</span> <span class="nb">Double</span><span class="p">(</span><span class="nv">$1</span><span class="p">.</span><span class="n">w</span><span class="p">))</span> <span class="p">}</span>
 <a id="__codelineno-5-18" name="__codelineno-5-18" href="#__codelineno-5-18"></a>    <span class="c1">// 循环贪心选择</span>
 <a id="__codelineno-5-19" name="__codelineno-5-19" href="#__codelineno-5-19"></a>    <span class="kd">var</span> <span class="nv">res</span> <span class="p">=</span> <span class="mf">0.0</span>
 <a id="__codelineno-5-20" name="__codelineno-5-20" href="#__codelineno-5-20"></a>    <span class="kd">var</span> <span class="nv">cap</span> <span class="p">=</span> <span class="n">cap</span>

chapter_greedy/max_capacity_problem/index.html

@@ -3810,7 +3810,7 @@ cap[i, j] = \min(ht[i], ht[j]) \times (j - i)
 <div class="highlight"><span class="filename">max_capacity.swift</span><pre><span></span><code><a id="__codelineno-5-1" name="__codelineno-5-1" href="#__codelineno-5-1"></a><span class="cm">/* 最大容量：贪心 */</span>
 <a id="__codelineno-5-2" name="__codelineno-5-2" href="#__codelineno-5-2"></a><span class="kd">func</span> <span class="nf">maxCapacity</span><span class="p">(</span><span class="n">ht</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>
 <a id="__codelineno-5-3" name="__codelineno-5-3" href="#__codelineno-5-3"></a>    <span class="c1">// 初始化 i, j，使其分列数组两端</span>
-<a id="__codelineno-5-4" name="__codelineno-5-4" href="#__codelineno-5-4"></a>    <span class="kd">var</span> <span class="nv">i</span> <span class="p">=</span> <span class="mi">0</span><span class="p">,</span> <span class="n">j</span> <span class="p">=</span> <span class="n">ht</span><span class="p">.</span><span class="bp">count</span> <span class="o">-</span> <span class="mi">1</span>
+<a id="__codelineno-5-4" name="__codelineno-5-4" href="#__codelineno-5-4"></a>    <span class="kd">var</span> <span class="nv">i</span> <span class="p">=</span> <span class="n">ht</span><span class="p">.</span><span class="n">startIndex</span><span class="p">,</span> <span class="n">j</span> <span class="p">=</span> <span class="n">ht</span><span class="p">.</span><span class="n">endIndex</span> <span class="o">-</span> <span class="mi">1</span>
 <a id="__codelineno-5-5" name="__codelineno-5-5" href="#__codelineno-5-5"></a>    <span class="c1">// 初始最大容量为 0</span>
 <a id="__codelineno-5-6" name="__codelineno-5-6" href="#__codelineno-5-6"></a>    <span class="kd">var</span> <span class="nv">res</span> <span class="p">=</span> <span class="mi">0</span>
 <a id="__codelineno-5-7" name="__codelineno-5-7" href="#__codelineno-5-7"></a>    <span class="c1">// 循环贪心选择，直至两板相遇</span>