CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-27 12:01:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-04 05:25:00 +08:00
parent 014ad545de
commit 63f09480fa
137 changed files with 8999 additions and 1143 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
chapter_greedy/fractional_knapsack_problem/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>

46
chapter_greedy/greedy_algorithm/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>

48
chapter_greedy/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>
@@ -3319,7 +3357,7 @@
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>向日葵朝着太阳转动，时刻都在追求自身成长的最大可能。</p>
<p>贪心策略既直接又高效，在一轮轮简单选择中逐步导向最佳答案。</p>
<p>贪心策略在一轮轮的简单选择中，逐步导向最佳的答案。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>

46
chapter_greedy/max_capacity_problem/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>

46
chapter_greedy/max_product_cutting_problem/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>

46
chapter_greedy/summary/index.html
View File

@@ -1767,6 +1767,8 @@
@@ -1835,14 +1837,50 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_insertion/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search_edge/" class="md-nav__link">
<span class="md-ellipsis">
10.2. &nbsp; 二分查找边界
10.3. &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1860,7 +1898,7 @@
<span class="md-ellipsis">
10.3. &nbsp; 哈希优化策略
10.4. &nbsp; 哈希优化策略
</span>
@@ -1880,7 +1918,7 @@
<span class="md-ellipsis">
10.4. &nbsp; 重识搜索算法
10.5. &nbsp; 重识搜索算法
</span>
@@ -1900,7 +1938,7 @@
<span class="md-ellipsis">
10.5. &nbsp; 小结
10.6. &nbsp; 小结
</span>