mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-10 14:20:43 +08:00
deploy
This commit is contained in:
krahets
Binary file not shown.
|
Before Width: | Height: | Size: 76 KiB After Width: | Height: | Size: 86 KiB |
@@ -3396,12 +3396,12 @@
|
||||
|
||||
<!-- Page content -->
|
||||
<h1 id="162">16.2 一起参与创作<a class="headerlink" href="#162" title="Permanent link">¶</a></h1>
|
||||
<p>由于作者能力有限，书中难免存在一些遗漏和错误，请您谅解。如果您发现了笔误、失效链接、内容缺失、文字歧义、解释不清晰或行文结构不合理等问题，请协助我们进行修正，以给读者提供更优质的学习资源。</p>
|
||||
<p>所有<a href="https://github.com/krahets/hello-algo/graphs/contributors">撰稿人</a>的 GitHub ID 将被展示在本书的仓库主页上，以感谢他们对开源社区的无私奉献。</p>
|
||||
<p>由于笔者能力有限，书中难免存在一些遗漏和错误，请您谅解。如果您发现了笔误、链接失效、内容缺失、文字歧义、解释不清晰或行文结构不合理等问题，请协助我们进行修正，以给读者提供更优质的学习资源。</p>
|
||||
<p>所有<a href="https://github.com/krahets/hello-algo/graphs/contributors">撰稿人</a>的 GitHub ID 将在本书仓库、网页版和 PDF 版的主页上进行展示，以感谢他们对开源社区的无私奉献。</p>
|
||||
<div class="admonition success">
|
||||
<p class="admonition-title">开源的魅力</p>
|
||||
<p>纸质书籍的两次印刷的间隔时间往往需要数年，内容更新非常不方便。</p>
|
||||
<p>然而在本开源书中，内容更迭的时间被缩短至数日甚至几个小时。</p>
|
||||
<p>纸质图书的两次印刷的间隔时间往往较久，内容更新非常不方便。</p>
|
||||
<p>而在本开源书中，内容更迭的时间被缩短至数日甚至几个小时。</p>
|
||||
</div>
|
||||
<h3 id="1">1. 内容微调<a class="headerlink" href="#1" title="Permanent link">¶</a></h3>
|
||||
<p>如图 16-1 所示，每个页面的右上角都有“编辑图标”。您可以按照以下步骤修改文本或代码。</p>
|
||||
@@ -3417,17 +3417,17 @@
|
||||
<h3 id="2">2. 内容创作<a class="headerlink" href="#2" title="Permanent link">¶</a></h3>
|
||||
<p>如果您有兴趣参与此开源项目，包括将代码翻译成其他编程语言、扩展文章内容等，那么需要实施以下 Pull Request 工作流程。</p>
|
||||
<ol>
|
||||
<li>登录 GitHub ，将<a href="https://github.com/krahets/hello-algo">本仓库</a> Fork 到个人账号下。</li>
|
||||
<li>登录 GitHub ，将本书的<a href="https://github.com/krahets/hello-algo">代码仓库</a> Fork 到个人账号下。</li>
|
||||
<li>进入您的 Fork 仓库网页，使用 <code>git clone</code> 命令将仓库克隆至本地。</li>
|
||||
<li>在本地进行内容创作，并进行完整测试，验证代码的正确性。</li>
|
||||
<li>将本地所做更改 Commit ，然后 Push 至远程仓库。</li>
|
||||
<li>刷新仓库网页，点击“Create pull request”按钮即可发起拉取请求。</li>
|
||||
</ol>
|
||||
<h3 id="3-docker">3. Docker 部署<a class="headerlink" href="#3-docker" title="Permanent link">¶</a></h3>
|
||||
<p>在 <code>hello-algo</code> 根目录下，执行以下 Docker 脚本，即可在 <code>http://localhost:8000</code> 访问本项目。</p>
|
||||
<p>在 <code>hello-algo</code> 根目录下，执行以下 Docker 脚本，即可在 <code>http://localhost:8000</code> 访问本项目：</p>
|
||||
<div class="highlight"><pre><span></span><code><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a>docker-compose<span class="w"> </span>up<span class="w"> </span>-d
|
||||
</code></pre></div>
|
||||
<p>使用以下命令即可删除部署。</p>
|
||||
<p>使用以下命令即可删除部署：</p>
|
||||
<div class="highlight"><pre><span></span><code><a id="__codelineno-1-1" name="__codelineno-1-1" href="#__codelineno-1-1"></a>docker-compose<span class="w"> </span>down
|
||||
</code></pre></div>
|
||||
|
||||
|
||||
@@ -3495,7 +3495,7 @@
|
||||
<!-- Page content -->
|
||||
<h1 id="161">16.1 编程环境安装<a class="headerlink" href="#161" title="Permanent link">¶</a></h1>
|
||||
<h3 id="1-vscode">1. VSCode<a class="headerlink" href="#1-vscode" title="Permanent link">¶</a></h3>
|
||||
<p>本书推荐使用开源轻量的 VSCode 作为本地 IDE ，下载并安装 <a href="https://code.visualstudio.com/">VSCode</a> 。</p>
|
||||
<p>本书推荐使用开源、轻量的 VSCode 作为本地 IDE ，下载并安装 <a href="https://code.visualstudio.com/">VSCode</a> 。</p>
|
||||
<h3 id="2-java">2. Java 环境<a class="headerlink" href="#2-java" title="Permanent link">¶</a></h3>
|
||||
<ol>
|
||||
<li>下载并安装 <a href="https://jdk.java.net/18/">OpenJDK</a>（版本需满足 > JDK 9）。</li>
|
||||
@@ -3503,7 +3503,7 @@
|
||||
</ol>
|
||||
<h3 id="3-cc">3. C/C++ 环境<a class="headerlink" href="#3-cc" title="Permanent link">¶</a></h3>
|
||||
<ol>
|
||||
<li>Windows 系统需要安装 <a href="https://sourceforge.net/projects/mingw-w64/files/">MinGW</a>（<a href="https://blog.csdn.net/qq_33698226/article/details/129031241">配置教程</a>），MacOS 自带 Clang 无须安装。</li>
|
||||
<li>Windows 系统需要安装 <a href="https://sourceforge.net/projects/mingw-w64/files/">MinGW</a>（<a href="https://blog.csdn.net/qq_33698226/article/details/129031241">配置教程</a>）；MacOS 自带 Clang ，无须安装。</li>
|
||||
<li>在 VSCode 的插件市场中搜索 <code>c++</code> ，安装 C/C++ Extension Pack 。</li>
|
||||
<li>（可选）打开 Settings 页面，搜索 <code>Clang_format_fallback Style</code> 代码格式化选项，设置为 <code>{ BasedOnStyle: Microsoft, BreakBeforeBraces: Attach }</code> 。</li>
|
||||
</ol>
|
||||
@@ -3517,7 +3517,7 @@
|
||||
<ol>
|
||||
<li>下载并安装 <a href="https://go.dev/dl/">go</a> 。</li>
|
||||
<li>在 VSCode 的插件市场中搜索 <code>go</code> ，安装 Go 。</li>
|
||||
<li>快捷键 <code>Ctrl + Shift + P</code> 呼出命令栏，输入 go ，选择 <code>Go: Install/Update Tools</code> ，全部勾选并安装即可。</li>
|
||||
<li>按快捷键 <code>Ctrl + Shift + P</code> 呼出命令栏，输入 go ，选择 <code>Go: Install/Update Tools</code> ，全部勾选并安装即可。</li>
|
||||
</ol>
|
||||
<h3 id="6-javascript">6. JavaScript 环境<a class="headerlink" href="#6-javascript" title="Permanent link">¶</a></h3>
|
||||
<ol>
|
||||
|
||||
@@ -3317,7 +3317,7 @@
|
||||
<!-- Page content -->
|
||||
<h1 id="163">16.3 术语表<a class="headerlink" href="#163" title="Permanent link">¶</a></h1>
|
||||
<p>表 16-1 列出了书中出现的重要术语。建议你同时记住它们的中英文叫法，以便阅读英文文献。</p>
|
||||
<p align="center"> 表 16-1 数据结构与算法重要名词 </p>
|
||||
<p align="center"> 表 16-1 数据结构与算法的重要名词 </p>
|
||||
|
||||
<div class="center-table">
|
||||
<table>
|
||||
@@ -3325,433 +3325,359 @@
|
||||
<tr>
|
||||
<th>中文</th>
|
||||
<th>English</th>
|
||||
<th>中文</th>
|
||||
<th>English</th>
|
||||
</tr>
|
||||
</thead>
|
||||
<tbody>
|
||||
<tr>
|
||||
<td>算法</td>
|
||||
<td>algorithm</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>数据结构</td>
|
||||
<td>data structure</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>渐近复杂度分析</td>
|
||||
<td>asymptotic complexity analysis</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>时间复杂度</td>
|
||||
<td>time complexity</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>空间复杂度</td>
|
||||
<td>space complexity</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>迭代</td>
|
||||
<td>iteration</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>递归</td>
|
||||
<td>recursion</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>尾递归</td>
|
||||
<td>tail recursion</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>递归树</td>
|
||||
<td>recursion tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>大 <span class="arithmatex">\(O\)</span> 记号</td>
|
||||
<td>big-<span class="arithmatex">\(O\)</span> notation</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>渐近上界</td>
|
||||
<td>asymptotic upper bound</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>原码</td>
|
||||
<td>sign–magnitude</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>反码</td>
|
||||
<td>1's complement</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>补码</td>
|
||||
<td>2's complement</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>数组</td>
|
||||
<td>array</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>索引</td>
|
||||
<td>index</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链表</td>
|
||||
<td>linked list</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链表节点</td>
|
||||
<td>linked list node, list node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>列表</td>
|
||||
<td>list</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>动态数组</td>
|
||||
<td>dynamic array</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>栈</td>
|
||||
<td>stack</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>队列</td>
|
||||
<td>queue</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>双向队列</td>
|
||||
<td>double-ended queue</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希表</td>
|
||||
<td>hash table</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>桶</td>
|
||||
<td>bucket</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希函数</td>
|
||||
<td>hash function</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希冲突</td>
|
||||
<td>hash collision</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>负载因子</td>
|
||||
<td>load factor</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链式地址</td>
|
||||
<td>separate chaining</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>开放寻址</td>
|
||||
<td>open addressing</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>线性探测</td>
|
||||
<td>linear probing</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>懒删除</td>
|
||||
<td>lazy deletion</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>二叉树</td>
|
||||
<td>binary tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>树节点</td>
|
||||
<td>tree node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>左子节点</td>
|
||||
<td>left-child node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>右子节点</td>
|
||||
<td>right-child node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>父节点</td>
|
||||
<td>parent node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>左子树</td>
|
||||
<td>left subtree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>右子树</td>
|
||||
<td>right subtree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>根节点</td>
|
||||
<td>root node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>叶节点</td>
|
||||
<td>leaf node</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>边</td>
|
||||
<td>edge</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>层</td>
|
||||
<td>level</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>度</td>
|
||||
<td>degree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>高度</td>
|
||||
<td>height</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>深度</td>
|
||||
<td>depth</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完美二叉树</td>
|
||||
<td>perfect binary tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完全二叉树</td>
|
||||
<td>complete binary tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完满二叉树</td>
|
||||
<td>full binary tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>平衡二叉树</td>
|
||||
<td>balanced binary tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>AVL 树</td>
|
||||
<td>AVL tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>红黑树</td>
|
||||
<td>red-black tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>层序遍历</td>
|
||||
<td>level-order traversal</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>数据结构</td>
|
||||
<td>data structure</td>
|
||||
<td>广度优先遍历</td>
|
||||
<td>breadth-first traversal</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>渐近复杂度分析</td>
|
||||
<td>asymptotic complexity analysis</td>
|
||||
<td>深度优先遍历</td>
|
||||
<td>depth-first traversal</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>时间复杂度</td>
|
||||
<td>time complexity</td>
|
||||
<td>二叉搜索树</td>
|
||||
<td>binary search tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>空间复杂度</td>
|
||||
<td>space complexity</td>
|
||||
<td>平衡二叉搜索树</td>
|
||||
<td>balanced binary search tree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>迭代</td>
|
||||
<td>iteration</td>
|
||||
<td>平衡因子</td>
|
||||
<td>balance factor</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>递归</td>
|
||||
<td>recursion</td>
|
||||
<td>堆</td>
|
||||
<td>heap</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>尾递归</td>
|
||||
<td>tail recursion</td>
|
||||
<td>大顶堆</td>
|
||||
<td>max heap</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>递归树</td>
|
||||
<td>recursion tree</td>
|
||||
<td>小顶堆</td>
|
||||
<td>min heap</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>大</td>
|
||||
<td>big-</td>
|
||||
<td>优先队列</td>
|
||||
<td>priority queue</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>记号</td>
|
||||
<td>notation</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>渐近上界</td>
|
||||
<td>asymptotic upper bound</td>
|
||||
<td>堆化</td>
|
||||
<td>heapify</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>原码</td>
|
||||
<td>sign–magnitude</td>
|
||||
<td>图</td>
|
||||
<td>graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>反码</td>
|
||||
<td>1’s complement</td>
|
||||
<td>顶点</td>
|
||||
<td>vertex</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>补码</td>
|
||||
<td>2’s complement</td>
|
||||
<td>无向图</td>
|
||||
<td>undirected graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>数组</td>
|
||||
<td>array</td>
|
||||
<td>有向图</td>
|
||||
<td>directed graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>索引</td>
|
||||
<td>index</td>
|
||||
<td>连通图</td>
|
||||
<td>connected graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链表</td>
|
||||
<td>linked list</td>
|
||||
<td>非连通图</td>
|
||||
<td>disconnected graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链表节点</td>
|
||||
<td>linked list node, list node</td>
|
||||
<td>有权图</td>
|
||||
<td>weighted graph</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>列表</td>
|
||||
<td>list</td>
|
||||
<td>邻接</td>
|
||||
<td>adjacency</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>动态数组</td>
|
||||
<td>dynamic array</td>
|
||||
<td>路径</td>
|
||||
<td>path</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>硬盘</td>
|
||||
<td>hard disk</td>
|
||||
<td>入度</td>
|
||||
<td>in-degree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>内存</td>
|
||||
<td>random-access memory (RAM)</td>
|
||||
<td>出度</td>
|
||||
<td>out-degree</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>缓存</td>
|
||||
<td>cache memory</td>
|
||||
<td>邻接矩阵</td>
|
||||
<td>adjacency matrix</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>缓存未命中</td>
|
||||
<td>cache miss</td>
|
||||
<td>邻接表</td>
|
||||
<td>adjacency list</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>缓存命中率</td>
|
||||
<td>cache hit rate</td>
|
||||
<td>广度优先搜索</td>
|
||||
<td>breadth-first search</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>栈</td>
|
||||
<td>stack</td>
|
||||
<td>深度优先搜索</td>
|
||||
<td>depth-first search</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>队列</td>
|
||||
<td>queue</td>
|
||||
<td>二分查找</td>
|
||||
<td>binary search</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>双向队列</td>
|
||||
<td>double-ended queue</td>
|
||||
<td>搜索算法</td>
|
||||
<td>searching algorithm</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希表</td>
|
||||
<td>hash table</td>
|
||||
<td>排序算法</td>
|
||||
<td>sorting algorithm</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>桶</td>
|
||||
<td>bucket</td>
|
||||
<td>选择排序</td>
|
||||
<td>selection sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希函数</td>
|
||||
<td>hash function</td>
|
||||
<td>冒泡排序</td>
|
||||
<td>bubble sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>哈希冲突</td>
|
||||
<td>hash collision</td>
|
||||
<td>插入排序</td>
|
||||
<td>insertion sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>负载因子</td>
|
||||
<td>load factor</td>
|
||||
<td>快速排序</td>
|
||||
<td>quick sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>链式地址</td>
|
||||
<td>separate chaining</td>
|
||||
<td>归并排序</td>
|
||||
<td>merge sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>开放寻址</td>
|
||||
<td>open addressing</td>
|
||||
<td>堆排序</td>
|
||||
<td>heap sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>线性探测</td>
|
||||
<td>linear probing</td>
|
||||
<td>桶排序</td>
|
||||
<td>bucket sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>懒删除</td>
|
||||
<td>lazy deletion</td>
|
||||
<td>计数排序</td>
|
||||
<td>counting sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>二叉树</td>
|
||||
<td>binary tree</td>
|
||||
<td>基数排序</td>
|
||||
<td>radix sort</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>树节点</td>
|
||||
<td>tree node</td>
|
||||
<td>分治</td>
|
||||
<td>divide and conquer</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>左子节点</td>
|
||||
<td>left-child node</td>
|
||||
<td>汉诺塔问题</td>
|
||||
<td>hanota problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>右子节点</td>
|
||||
<td>right-child node</td>
|
||||
<td>回溯算法</td>
|
||||
<td>backtracking algorithm</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>父节点</td>
|
||||
<td>parent node</td>
|
||||
<td>约束</td>
|
||||
<td>constraint</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>左子树</td>
|
||||
<td>left subtree</td>
|
||||
<td>解</td>
|
||||
<td>solution</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>右子树</td>
|
||||
<td>right subtree</td>
|
||||
<td>状态</td>
|
||||
<td>state</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>根节点</td>
|
||||
<td>root node</td>
|
||||
<td>剪枝</td>
|
||||
<td>pruning</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>叶节点</td>
|
||||
<td>leaf node</td>
|
||||
<td>全排列问题</td>
|
||||
<td>permutations problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>边</td>
|
||||
<td>edge</td>
|
||||
<td>子集和问题</td>
|
||||
<td>subset-sum problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>层</td>
|
||||
<td>level</td>
|
||||
<td>N 皇后问题</td>
|
||||
<td>N-queens problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>度</td>
|
||||
<td>degree</td>
|
||||
<td>动态规划</td>
|
||||
<td>dynamic programming</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>高度</td>
|
||||
<td>height</td>
|
||||
<td>初始状态</td>
|
||||
<td>initial state</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>深度</td>
|
||||
<td>depth</td>
|
||||
<td>状态转移方程</td>
|
||||
<td>state-trasition equation</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完美二叉树</td>
|
||||
<td>perfect binary tree</td>
|
||||
<td>背包问题</td>
|
||||
<td>knapsack problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完全二叉树</td>
|
||||
<td>complete binary tree</td>
|
||||
<td>编辑距离问题</td>
|
||||
<td>edit distance problem</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>完满二叉树</td>
|
||||
<td>full binary tree</td>
|
||||
<td>贪心算法</td>
|
||||
<td>greedy algorithm</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>平衡二叉树</td>
|
||||
<td>balanced binary tree</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>AVL 树</td>
|
||||
<td>AVL tree</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>红黑树</td>
|
||||
<td>red-black tree</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user