algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-30 05:43:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-02-19 01:24:13 +08:00
parent f832e08d9d
commit 8a7c5978c8
50 changed files with 3541 additions and 3541 deletions
Download Patch File Download Diff File Expand all files Collapse all files

150
chapter_introduction/what_is_dsa/index.html
View File

@ -25,7 +25,7 @@
<title>1.2. 算法是什么 - Hello 算法</title>
<title>算法是什么 - Hello 算法</title>
@ -111,7 +111,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
1.2. 算法是什么
算法是什么
</span>
</div>
@ -268,14 +268,14 @@
<label class="md-nav__link" for="__nav_1" id="__nav_1_label" tabindex="0">
0. 写在前面
写在前面
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_1_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_1">
<span class="md-nav__icon md-icon"></span>
0. 写在前面
写在前面
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -286,7 +286,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/about_the_book/" class="md-nav__link">
0.1. 关于本书
关于本书
</a>
</li>
@ -300,7 +300,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/suggestions/" class="md-nav__link">
0.2. 如何使用本书
如何使用本书
</a>
</li>
@ -314,7 +314,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/installation/" class="md-nav__link">
0.3. 编程环境安装
编程环境安装
</a>
</li>
@ -328,7 +328,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/contribution/" class="md-nav__link">
0.4. 一起参与创作
一起参与创作
</a>
</li>
@ -369,14 +369,14 @@
<label class="md-nav__link" for="__nav_2" id="__nav_2_label" tabindex="0">
1. 引言
引言
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_2_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_2">
<span class="md-nav__icon md-icon"></span>
1. 引言
引言
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -387,7 +387,7 @@
<li class="md-nav__item">
<a href="../algorithms_are_everywhere/" class="md-nav__link">
1.1. 算法无处不在
算法无处不在
</a>
</li>
@ -410,12 +410,12 @@
<label class="md-nav__link md-nav__link--active" for="__toc">
1.2. 算法是什么
算法是什么
<span class="md-nav__icon md-icon"></span>
</label>
<a href="./" class="md-nav__link md-nav__link--active">
1.2. 算法是什么
算法是什么
</a>
@ -501,14 +501,14 @@
<label class="md-nav__link" for="__nav_3" id="__nav_3_label" tabindex="0">
2. 计算复杂度
计算复杂度
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
2. 计算复杂度
计算复杂度
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -519,7 +519,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/performance_evaluation/" class="md-nav__link">
2.1. 算法效率评估
算法效率评估
</a>
</li>
@ -533,7 +533,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/time_complexity/" class="md-nav__link">
2.2. 时间复杂度
时间复杂度
</a>
</li>
@ -547,7 +547,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/space_complexity/" class="md-nav__link">
2.3. 空间复杂度
空间复杂度
</a>
</li>
@ -561,7 +561,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/space_time_tradeoff/" class="md-nav__link">
2.4. 权衡时间与空间
权衡时间与空间
</a>
</li>
@ -575,7 +575,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/summary/" class="md-nav__link">
2.5. 小结
小结
</a>
</li>
@ -616,14 +616,14 @@
<label class="md-nav__link" for="__nav_4" id="__nav_4_label" tabindex="0">
3. 数据结构简介
数据结构简介
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_4_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_4">
<span class="md-nav__icon md-icon"></span>
3. 数据结构简介
数据结构简介
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -634,7 +634,7 @@
<li class="md-nav__item">
<a href="../../chapter_data_structure/data_and_memory/" class="md-nav__link">
3.1. 数据与内存
数据与内存
</a>
</li>
@ -648,7 +648,7 @@
<li class="md-nav__item">
<a href="../../chapter_data_structure/classification_of_data_structure/" class="md-nav__link">
3.2. 数据结构分类
数据结构分类
</a>
</li>
@ -662,7 +662,7 @@
<li class="md-nav__item">
<a href="../../chapter_data_structure/summary/" class="md-nav__link">
3.3. 小结
小结
</a>
</li>
@ -705,14 +705,14 @@
<label class="md-nav__link" for="__nav_5" id="__nav_5_label" tabindex="0">
4. 数组与链表
数组与链表
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_5_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_5">
<span class="md-nav__icon md-icon"></span>
4. 数组与链表
数组与链表
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -723,7 +723,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/array/" class="md-nav__link">
4.1. 数组（Array）
数组（Array）
</a>
</li>
@ -737,7 +737,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/linked_list/" class="md-nav__link">
4.2. 链表（LinkedList）
链表（LinkedList）
</a>
</li>
@ -751,7 +751,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/list/" class="md-nav__link">
4.3. 列表（List）
列表（List）
</a>
</li>
@ -765,7 +765,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/summary/" class="md-nav__link">
4.4. 小结
小结
</a>
</li>
@ -808,14 +808,14 @@
<label class="md-nav__link" for="__nav_6" id="__nav_6_label" tabindex="0">
5. 栈与队列
栈与队列
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_6_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_6">
<span class="md-nav__icon md-icon"></span>
5. 栈与队列
栈与队列
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -826,7 +826,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/stack/" class="md-nav__link">
5.1. 栈（Stack）
栈（Stack）
</a>
</li>
@ -840,7 +840,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/queue/" class="md-nav__link">
5.2. 队列（Queue）
队列（Queue）
</a>
</li>
@ -854,7 +854,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/deque/" class="md-nav__link">
5.3. 双向队列（Deque）
双向队列（Deque）
</a>
</li>
@ -868,7 +868,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/summary/" class="md-nav__link">
5.4. 小结
小结
</a>
</li>
@ -909,14 +909,14 @@
<label class="md-nav__link" for="__nav_7" id="__nav_7_label" tabindex="0">
6. 散列表
散列表
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_7_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_7">
<span class="md-nav__icon md-icon"></span>
6. 散列表
散列表
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -927,7 +927,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_map/" class="md-nav__link">
6.1. 哈希表（HashMap）
哈希表（HashMap）
</a>
</li>
@ -941,7 +941,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_collision/" class="md-nav__link">
6.2. 哈希冲突处理
哈希冲突处理
</a>
</li>
@ -955,7 +955,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/summary/" class="md-nav__link">
6.3. 小结
小结
</a>
</li>
@ -1000,14 +1000,14 @@
<label class="md-nav__link" for="__nav_8" id="__nav_8_label" tabindex="0">
7. 二叉树
二叉树
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_8_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_8">
<span class="md-nav__icon md-icon"></span>
7. 二叉树
二叉树
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1018,7 +1018,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_tree/" class="md-nav__link">
7.1. 二叉树（Binary Tree）
二叉树（Binary Tree）
</a>
</li>
@ -1032,7 +1032,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_tree_traversal/" class="md-nav__link">
7.2. 二叉树遍历
二叉树遍历
</a>
</li>
@ -1046,7 +1046,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_search_tree/" class="md-nav__link">
7.3. 二叉搜索树
二叉搜索树
</a>
</li>
@ -1060,7 +1060,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/avl_tree/" class="md-nav__link">
7.4. AVL 树 *
AVL 树 *
</a>
</li>
@ -1074,7 +1074,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/summary/" class="md-nav__link">
7.5. 小结
小结
</a>
</li>
@ -1111,14 +1111,14 @@
<label class="md-nav__link" for="__nav_9" id="__nav_9_label" tabindex="0">
8. 堆
堆
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_9_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_9">
<span class="md-nav__icon md-icon"></span>
8. 堆
堆
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1129,7 +1129,7 @@
<li class="md-nav__item">
<a href="../../chapter_heap/heap/" class="md-nav__link">
8.1. 堆（Heap）
堆（Heap）
</a>
</li>
@ -1170,14 +1170,14 @@
<label class="md-nav__link" for="__nav_10" id="__nav_10_label" tabindex="0">
9. 图
图
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_10_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_10">
<span class="md-nav__icon md-icon"></span>
9. 图
图
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1188,7 +1188,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph/" class="md-nav__link">
9.1. 图（Graph）
图（Graph）
</a>
</li>
@ -1202,7 +1202,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph_operations/" class="md-nav__link">
9.2. 图基础操作
图基础操作
</a>
</li>
@ -1216,7 +1216,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph_traversal/" class="md-nav__link">
9.3. 图的遍历
图的遍历
</a>
</li>
@ -1259,14 +1259,14 @@
<label class="md-nav__link" for="__nav_11" id="__nav_11_label" tabindex="0">
10. 查找算法
查找算法
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_11_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_11">
<span class="md-nav__icon md-icon"></span>
10. 查找算法
查找算法
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1277,7 +1277,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/linear_search/" class="md-nav__link">
10.1. 线性查找
线性查找
</a>
</li>
@ -1291,7 +1291,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search/" class="md-nav__link">
10.2. 二分查找
二分查找
</a>
</li>
@ -1305,7 +1305,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/hashing_search/" class="md-nav__link">
10.3. 哈希查找
哈希查找
</a>
</li>
@ -1319,7 +1319,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/summary/" class="md-nav__link">
10.4. 小结
小结
</a>
</li>
@ -1366,14 +1366,14 @@
<label class="md-nav__link" for="__nav_12" id="__nav_12_label" tabindex="0">
11. 排序算法
排序算法
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_12_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_12">
<span class="md-nav__icon md-icon"></span>
11. 排序算法
排序算法
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1384,7 +1384,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/intro_to_sort/" class="md-nav__link">
11.1. 排序简介
排序简介
</a>
</li>
@ -1398,7 +1398,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/bubble_sort/" class="md-nav__link">
11.2. 冒泡排序
冒泡排序
</a>
</li>
@ -1412,7 +1412,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/insertion_sort/" class="md-nav__link">
11.3. 插入排序
插入排序
</a>
</li>
@ -1426,7 +1426,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/quick_sort/" class="md-nav__link">
11.4. 快速排序
快速排序
</a>
</li>
@ -1440,7 +1440,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/merge_sort/" class="md-nav__link">
11.5. 归并排序
归并排序
</a>
</li>
@ -1454,7 +1454,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/summary/" class="md-nav__link">
11.6. 小结
小结
</a>
</li>
@ -1722,7 +1722,7 @@
<nav class="md-footer__inner md-grid" aria-label="页脚" >
<a href="../algorithms_are_everywhere/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 1.1. 算法无处不在" rel="prev">
<a href="../algorithms_are_everywhere/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 算法无处不在" rel="prev">
<div class="md-footer__button md-icon">
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
</div>
@ -1731,20 +1731,20 @@
<span class="md-footer__direction">
上一页
</span>
1.1. 算法无处不在
算法无处不在
</div>
</div>
</a>
<a href="../../chapter_computational_complexity/performance_evaluation/" class="md-footer__link md-footer__link--next" aria-label="下一页: 2.1. 算法效率评估" rel="next">
<a href="../../chapter_computational_complexity/performance_evaluation/" class="md-footer__link md-footer__link--next" aria-label="下一页: 算法效率评估" rel="next">
<div class="md-footer__title">
<div class="md-ellipsis">
<span class="md-footer__direction">
下一页
</span>
2.1. 算法效率评估
算法效率评估
</div>
</div>
<div class="md-footer__button md-icon">