7
7
< meta name ="viewport " content ="width=device-width, initial-scale=1.0 ">
8
8
9
9
10
+
10
11
< link rel ="shortcut icon " href ="../../img/favicon.ico ">
11
12
< title > 00_课程简介之笨方法学算法 - Python 数据结构与算法视频教程</ title >
12
- < link href =' https://fonts.googleapis.com/css?family=Lato:400,700|Roboto+Slab:400,700|Inconsolata:400,700 ' rel =' stylesheet ' type =' text/css ' >
13
+ < link rel =" stylesheet " href =" https://fonts.googleapis.com/css?family=Lato:400,700|Roboto+Slab:400,700|Inconsolata:400,700 " / >
13
14
14
- < link rel ="stylesheet " href ="../../css/theme.css " type =" text/css " />
15
- < link rel ="stylesheet " href ="../../css/theme_extra.css " type =" text/css " />
16
- < link rel ="stylesheet " href ="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/github.min.css ">
15
+ < link rel ="stylesheet " href ="../../css/theme.css " />
16
+ < link rel ="stylesheet " href ="../../css/theme_extra.css " />
17
+ < link rel ="stylesheet " href ="https: //cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/styles/github.min.css " / >
17
18
18
19
< script >
19
20
// Current page data
24
25
25
26
< script src ="../../js/jquery-2.1.1.min.js " defer > </ script >
26
27
< script src ="../../js/modernizr-2.8.3.min.js " defer > </ script >
27
- < script src ="//cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/highlight.min.js "> </ script >
28
+ < script src ="https: //cdnjs.cloudflare.com/ajax/libs/highlight.js/9.12.0/highlight.min.js "> </ script >
28
29
< script > hljs . initHighlightingOnLoad ( ) ; </ script >
29
30
30
31
</ head >
35
36
36
37
37
38
< nav data-toggle ="wy-nav-shift " class ="wy-nav-side stickynav ">
39
+ < div class ="wy-side-scroll ">
38
40
< div class ="wy-side-nav-search ">
39
41
< a href ="../.. " class ="icon icon-home "> Python 数据结构与算法视频教程</ a >
40
42
< div role ="search ">
45
47
</ div >
46
48
47
49
< div class ="wy-menu wy-menu-vertical " data-spy ="affix " role ="navigation " aria-label ="main navigation ">
48
- < ul class ="current ">
49
-
50
-
51
- < li class ="toctree-l1 ">
52
-
53
- < a class ="" href ="../.. "> 课程简介</ a >
54
- </ li >
55
-
56
- < li class ="toctree-l1 current ">
57
-
58
- < a class ="current " href ="./ "> 00_课程简介之笨方法学算法</ a >
59
- < ul class ="subnav ">
60
-
61
- < li class ="toctree-l2 "> < a href ="#_1 "> 什么是算法和数据结构?</ a > </ li >
62
-
63
-
64
- < li class ="toctree-l2 "> < a href ="#_2 "> 笨方法学算法</ a > </ li >
65
-
66
-
67
- < li class ="toctree-l2 "> < a href ="#_3 "> 小问题</ a > </ li >
68
-
69
-
70
- </ ul >
71
- </ li >
72
-
73
- < li class ="toctree-l1 ">
74
-
75
- < a class ="" href ="../../01_抽象数据类型和面向对象编程/ADT_OOP/ "> 01_抽象数据类型和面向对象编程</ a >
76
- </ li >
77
-
78
- < li class ="toctree-l1 ">
79
-
80
- < a class ="" href ="../../02_数组和列表/array_and_list/ "> 02_数组和列表</ a >
81
- </ li >
82
-
83
- < li class ="toctree-l1 ">
84
-
85
- < a class ="" href ="../../03_链表/linked_list/ "> 03_链表</ a >
86
- </ li >
87
-
88
- < li class ="toctree-l1 ">
89
-
90
- < a class ="" href ="../../04_队列/queue/ "> 04_队列</ a >
91
- </ li >
92
-
93
- < li class ="toctree-l1 ">
94
-
95
- < a class ="" href ="../../05_栈/stack/ "> 05_栈</ a >
96
- </ li >
97
-
98
- < li class ="toctree-l1 ">
99
-
100
- < a class ="" href ="../../06_算法分析/big_o/ "> 06_算法分析</ a >
101
- </ li >
102
-
103
- < li class ="toctree-l1 ">
104
-
105
- < a class ="" href ="../../07_哈希表/hashtable/ "> 07_哈希表</ a >
106
- </ li >
107
-
108
- < li class ="toctree-l1 ">
109
-
110
- < a class ="" href ="../../08_字典/dict/ "> 08_字典</ a >
111
- </ li >
112
-
113
- < li class ="toctree-l1 ">
114
-
115
- < a class ="" href ="../../09_集合/set/ "> 09_集合</ a >
116
- </ li >
117
-
118
- < li class ="toctree-l1 ">
119
-
120
- < a class ="" href ="../../10_递归/recursion/ "> 10_递归</ a >
121
- </ li >
122
-
123
- < li class ="toctree-l1 ">
124
-
125
- < a class ="" href ="../../11_线性查找与二分查找/search/ "> 11_线性查找与二分查找</ a >
126
- </ li >
127
-
128
- < li class ="toctree-l1 ">
129
-
130
- < a class ="" href ="../../12_基本排序算法/basic_sort/ "> 12_基本排序算法</ a >
131
- </ li >
132
-
133
- < li class ="toctree-l1 ">
134
-
135
- < span class ="caption-text "> 13_高级排序算法</ span >
136
- < ul class ="subnav ">
137
- < li class ="">
138
-
139
- < a class ="" href ="../../13_高级排序算法/advanced_sorting/ "> 高级排序算法</ a >
140
- </ li >
141
- < li class ="">
142
-
143
- < a class ="" href ="../../13_高级排序算法/merge_sort/ "> 分治法与归并排序</ a >
144
- </ li >
145
- < li class ="">
146
-
147
- < a class ="" href ="../../13_高级排序算法/quick_sort/ "> 快速排序</ a >
148
- </ li >
50
+ < ul >
51
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../.. "> 课程简介</ a >
52
+ </ li >
53
+ </ ul >
54
+ < ul class ="current ">
55
+ < li class ="toctree-l1 current "> < a class ="reference internal current " href ="./ "> 00_课程简介之笨方法学算法</ a >
56
+ < ul class ="current ">
149
57
</ ul >
150
- </ li >
151
-
152
- < li class ="toctree-l1 ">
153
-
154
- < a class ="" href ="../../14_树与二叉树/tree/ "> 14_树与二叉树</ a >
155
- </ li >
156
-
157
- < li class ="toctree-l1 ">
158
-
159
- < a class ="" href ="../../15_堆与堆排序/heap_and_heapsort/ "> 15_堆和堆排序</ a >
160
- </ li >
161
-
162
- < li class ="toctree-l1 ">
163
-
164
- < a class ="" href ="../../16_优先级队列/priority_queue/ "> 16_优先级队列</ a >
165
- </ li >
166
-
167
- < li class ="toctree-l1 ">
168
-
169
- < a class ="" href ="../../17_二叉查找树/binary_search_tree/ "> 17_二叉查找树</ a >
170
- </ li >
171
-
172
- < li class ="toctree-l1 ">
173
-
174
- < a class ="" href ="../../18_图与图的遍历/graph/ "> 18_图与图的遍历</ a >
175
- </ li >
176
-
177
- < li class ="toctree-l1 ">
178
-
179
- < a class ="" href ="../../19_python内置常用算法和数据结构/builtins/ "> 19_python内置常用算法和数据结构</ a >
180
- </ li >
181
-
182
- < li class ="toctree-l1 ">
183
-
184
- < a class ="" href ="../../20_面试指南/interview/ "> 20_面试指南</ a >
185
- </ li >
186
-
187
- </ ul >
58
+ </ li >
59
+ </ ul >
60
+ < ul >
61
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../01_%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B%E5%92%8C%E9%9D%A2%E5%90%91%E5%AF%B9%E8%B1%A1%E7%BC%96%E7%A8%8B/ADT_OOP/ "> 01_抽象数据类型和面向对象编程</ a >
62
+ </ li >
63
+ </ ul >
64
+ < ul >
65
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../02_%E6%95%B0%E7%BB%84%E5%92%8C%E5%88%97%E8%A1%A8/array_and_list/ "> 02_数组和列表</ a >
66
+ </ li >
67
+ </ ul >
68
+ < ul >
69
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../03_%E9%93%BE%E8%A1%A8/linked_list/ "> 03_链表</ a >
70
+ </ li >
71
+ </ ul >
72
+ < ul >
73
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../04_%E9%98%9F%E5%88%97/queue/ "> 04_队列</ a >
74
+ </ li >
75
+ </ ul >
76
+ < ul >
77
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../05_%E6%A0%88/stack/ "> 05_栈</ a >
78
+ </ li >
79
+ </ ul >
80
+ < ul >
81
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../06_%E7%AE%97%E6%B3%95%E5%88%86%E6%9E%90/big_o/ "> 06_算法分析</ a >
82
+ </ li >
83
+ </ ul >
84
+ < ul >
85
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../07_%E5%93%88%E5%B8%8C%E8%A1%A8/hashtable/ "> 07_哈希表</ a >
86
+ </ li >
87
+ </ ul >
88
+ < ul >
89
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../08_%E5%AD%97%E5%85%B8/dict/ "> 08_字典</ a >
90
+ </ li >
91
+ </ ul >
92
+ < ul >
93
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../09_%E9%9B%86%E5%90%88/set/ "> 09_集合</ a >
94
+ </ li >
95
+ </ ul >
96
+ < ul >
97
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../10_%E9%80%92%E5%BD%92/recursion/ "> 10_递归</ a >
98
+ </ li >
99
+ </ ul >
100
+ < ul >
101
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../11_%E7%BA%BF%E6%80%A7%E6%9F%A5%E6%89%BE%E4%B8%8E%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE/search/ "> 11_线性查找与二分查找</ a >
102
+ </ li >
103
+ </ ul >
104
+ < ul >
105
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../12_%E5%9F%BA%E6%9C%AC%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95/basic_sort/ "> 12_基本排序算法</ a >
106
+ </ li >
107
+ </ ul >
108
+ < p class ="caption "> < span class ="caption-text "> 13_高级排序算法</ span > </ p >
109
+ < ul >
110
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../13_%E9%AB%98%E7%BA%A7%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95/advanced_sorting/ "> 高级排序算法</ a >
111
+ </ li >
112
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../13_%E9%AB%98%E7%BA%A7%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95/merge_sort/ "> 分治法与归并排序</ a >
113
+ </ li >
114
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../13_%E9%AB%98%E7%BA%A7%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95/quick_sort/ "> 快速排序</ a >
115
+ </ li >
116
+ </ ul >
117
+ < ul >
118
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../14_%E6%A0%91%E4%B8%8E%E4%BA%8C%E5%8F%89%E6%A0%91/tree/ "> 14_树与二叉树</ a >
119
+ </ li >
120
+ </ ul >
121
+ < ul >
122
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../15_%E5%A0%86%E4%B8%8E%E5%A0%86%E6%8E%92%E5%BA%8F/heap_and_heapsort/ "> 15_堆和堆排序</ a >
123
+ </ li >
124
+ </ ul >
125
+ < ul >
126
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../16_%E4%BC%98%E5%85%88%E7%BA%A7%E9%98%9F%E5%88%97/priority_queue/ "> 16_优先级队列</ a >
127
+ </ li >
128
+ </ ul >
129
+ < ul >
130
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../17_%E4%BA%8C%E5%8F%89%E6%9F%A5%E6%89%BE%E6%A0%91/binary_search_tree/ "> 17_二叉查找树</ a >
131
+ </ li >
132
+ </ ul >
133
+ < ul >
134
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../18_%E5%9B%BE%E4%B8%8E%E5%9B%BE%E7%9A%84%E9%81%8D%E5%8E%86/graph/ "> 18_图与图的遍历</ a >
135
+ </ li >
136
+ </ ul >
137
+ < ul >
138
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../19_python%E5%86%85%E7%BD%AE%E5%B8%B8%E7%94%A8%E7%AE%97%E6%B3%95%E5%92%8C%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/builtins/ "> 19_python内置常用算法和数据结构</ a >
139
+ </ li >
140
+ </ ul >
141
+ < ul >
142
+ < li class ="toctree-l1 "> < a class ="reference internal " href ="../../20_%E9%9D%A2%E8%AF%95%E6%8C%87%E5%8D%97/interview/ "> 20_面试指南</ a >
143
+ </ li >
144
+ </ ul >
188
145
</ div >
189
-
146
+ </ div >
190
147
</ nav >
191
148
192
149
< section data-toggle ="wy-nav-shift " class ="wy-nav-content-wrap ">
211
168
212
169
</ li >
213
170
</ ul >
171
+
214
172
< hr />
215
173
</ div >
216
174
< div role ="main ">
@@ -247,7 +205,7 @@ <h1 id="_3">小问题</h1>
247
205
248
206
< div class ="rst-footer-buttons " role ="navigation " aria-label ="footer navigation ">
249
207
250
- < a href ="../../01_抽象数据类型和面向对象编程 /ADT_OOP/ " class ="btn btn-neutral float-right " title ="01_抽象数据类型和面向对象编程 "> Next < span class ="icon icon-circle-arrow-right "> </ span > </ a >
208
+ < a href ="../../01_%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B%E5%92%8C%E9%9D%A2%E5%90%91%E5%AF%B9%E8%B1%A1%E7%BC%96%E7%A8%8B /ADT_OOP/ " class ="btn btn-neutral float-right " title ="01_抽象数据类型和面向对象编程 "> Next < span class ="icon icon-circle-arrow-right "> </ span > </ a >
251
209
252
210
253
211
< a href ="../.. " class ="btn btn-neutral " title ="课程简介 "> < span class ="icon icon-circle-arrow-left "> </ span > Previous</ a >
@@ -262,7 +220,7 @@ <h1 id="_3">小问题</h1>
262
220
263
221
</ div >
264
222
265
- Built with < a href ="http ://www.mkdocs.org "> MkDocs</ a > using a < a href ="https://github.com/snide/sphinx_rtd_theme "> theme</ a > provided by < a href ="https://readthedocs.org "> Read the Docs</ a > .
223
+ Built with < a href ="https ://www.mkdocs.org/ "> MkDocs</ a > using a < a href ="https://github.com/snide/sphinx_rtd_theme "> theme</ a > provided by < a href ="https://readthedocs.org "> Read the Docs</ a > .
266
224
</ footer >
267
225
268
226
</ div >
@@ -272,21 +230,26 @@ <h1 id="_3">小问题</h1>
272
230
273
231
</ div >
274
232
275
- < div class ="rst-versions " role ="note " style =" cursor: pointer ">
233
+ < div class ="rst-versions " role ="note " aria-label =" versions ">
276
234
< span class ="rst-current-version " data-toggle ="rst-current-version ">
277
235
278
236
279
237
< span > < a href ="../.. " style ="color: #fcfcfc; "> « Previous</ a > </ span >
280
238
281
239
282
- < span style ="margin-left: 15px "> < a href ="../../01_抽象数据类型和面向对象编程 /ADT_OOP/ " style ="color: #fcfcfc "> Next »</ a > </ span >
240
+ < span style ="margin-left: 15px "> < a href ="../../01_%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B%E5%92%8C%E9%9D%A2%E5%90%91%E5%AF%B9%E8%B1%A1%E7%BC%96%E7%A8%8B /ADT_OOP/ " style ="color: #fcfcfc "> Next »</ a > </ span >
283
241
284
242
</ span >
285
243
</ div >
286
244
< script > var base_url = '../..' ; </ script >
287
245
< script src ="../../js/theme.js " defer > </ script >
288
246
< script src ="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML " defer > </ script >
289
247
< script src ="../../search/main.js " defer > </ script >
248
+ < script defer >
249
+ window . onload = function ( ) {
250
+ SphinxRtdTheme . Navigation . enable ( true ) ;
251
+ } ;
252
+ </ script >
290
253
291
254
</ body >
292
255
</ html >
0 commit comments