Skip to content

Commit 6781b9f

Browse files
PegasusWangPegasusWang
committed
Deployed 06c27e5 with MkDocs version: 0.17.3
1 parent 75281a8 commit 6781b9f

File tree

37 files changed

+1949
-33
lines changed

37 files changed

+1949
-33
lines changed

‎00_课程简介之笨方法学算法/why_and_how_to_learn/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -148,6 +148,21 @@
148148
</ul>
149149
</li>
150150

151+
<li class="toctree-l1">
152+
153+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
154+
</li>
155+
156+
<li class="toctree-l1">
157+
158+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
159+
</li>
160+
161+
<li class="toctree-l1">
162+
163+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
164+
</li>
165+
151166
</ul>
152167
</div>
153168
&nbsp;

‎01_抽象数据类型和面向对象编程/ADT_OOP/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -157,6 +157,21 @@
157157
</ul>
158158
</li>
159159

160+
<li class="toctree-l1">
161+
162+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
163+
</li>
164+
165+
<li class="toctree-l1">
166+
167+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
168+
</li>
169+
170+
<li class="toctree-l1">
171+
172+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
173+
</li>
174+
160175
</ul>
161176
</div>
162177
&nbsp;

‎02_数组和列表/array_and_list/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -157,6 +157,21 @@
157157
</ul>
158158
</li>
159159

160+
<li class="toctree-l1">
161+
162+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
163+
</li>
164+
165+
<li class="toctree-l1">
166+
167+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
168+
</li>
169+
170+
<li class="toctree-l1">
171+
172+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
173+
</li>
174+
160175
</ul>
161176
</div>
162177
&nbsp;

‎03_链表/linked_list/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -154,6 +154,21 @@
154154
</ul>
155155
</li>
156156

157+
<li class="toctree-l1">
158+
159+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
160+
</li>
161+
162+
<li class="toctree-l1">
163+
164+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
165+
</li>
166+
167+
<li class="toctree-l1">
168+
169+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
170+
</li>
171+
157172
</ul>
158173
</div>
159174
&nbsp;

‎04_队列/queue/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -154,6 +154,21 @@
154154
</ul>
155155
</li>
156156

157+
<li class="toctree-l1">
158+
159+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
160+
</li>
161+
162+
<li class="toctree-l1">
163+
164+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
165+
</li>
166+
167+
<li class="toctree-l1">
168+
169+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
170+
</li>
171+
157172
</ul>
158173
</div>
159174
&nbsp;

‎05_栈/stack/index.html

Lines changed: 19 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -151,6 +151,21 @@
151151
</ul>
152152
</li>
153153

154+
<li class="toctree-l1">
155+
156+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
157+
</li>
158+
159+
<li class="toctree-l1">
160+
161+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
162+
</li>
163+
164+
<li class="toctree-l1">
165+
166+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
167+
</li>
168+
154169
</ul>
155170
</div>
156171
&nbsp;
@@ -187,8 +202,10 @@ <h1 id="_1">栈</h1>
187202
<p>栈这个词实际上在计算机科学里使用很多，除了数据结构外，还有内存里的栈区 （和堆对应），熟悉 C 系语言的话应该不会陌生。
188203
上一章我们讲到了先进先出 queue，其实用 python 的内置类型 collections.deque 或者我们自己实现的 LinkedList 来实现它都很简单。
189204
本章我们讲讲 后进先出的栈。</p>
190-
<p>生活中的数据结构：
191-
- 栈。好比在桶里头放盘子，先放的盘子放在了底下，后来的盘子放在上边。你要拿的时候，也是先拿最上边的。</p>
205+
<p>生活中的数据结构：</p>
206+
<ul>
207+
<li>栈。好比在桶里头放盘子，先放的盘子放在了底下，后来的盘子放在上边。你要拿的时候，也是先拿最上边的。</li>
208+
</ul>
192209
<p>栈其实也很简单，因为基础操作就俩，一个 push 和一个 pop，咦，咋和队列一样的？
193210
确实方法名字一样，但是得到的结果可是不同的。</p>
194211
<h1 id="adt">栈 ADT</h1>

‎06_算法分析/big_o/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -166,6 +166,21 @@
166166
</ul>
167167
</li>
168168

169+
<li class="toctree-l1">
170+
171+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
172+
</li>
173+
174+
<li class="toctree-l1">
175+
176+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
177+
</li>
178+
179+
<li class="toctree-l1">
180+
181+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
182+
</li>
183+
169184
</ul>
170185
</div>
171186
&nbsp;

‎07_哈希表/hashtable/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -166,6 +166,21 @@
166166
</ul>
167167
</li>
168168

169+
<li class="toctree-l1">
170+
171+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
172+
</li>
173+
174+
<li class="toctree-l1">
175+
176+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
177+
</li>
178+
179+
<li class="toctree-l1">
180+
181+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
182+
</li>
183+
169184
</ul>
170185
</div>
171186
&nbsp;

‎08_字典/dict/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -154,6 +154,21 @@
154154
</ul>
155155
</li>
156156

157+
<li class="toctree-l1">
158+
159+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
160+
</li>
161+
162+
<li class="toctree-l1">
163+
164+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
165+
</li>
166+
167+
<li class="toctree-l1">
168+
169+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
170+
</li>
171+
157172
</ul>
158173
</div>
159174
&nbsp;

‎09_集合/set/index.html

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -157,6 +157,21 @@
157157
</ul>
158158
</li>
159159

160+
<li class="toctree-l1">
161+
162+
<a class="" href="../../14_树与二叉树/tree/">树与二叉树</a>
163+
</li>
164+
165+
<li class="toctree-l1">
166+
167+
<a class="" href="../../15_堆与堆排序/heap_and_heapsort/">堆和堆排序</a>
168+
</li>
169+
170+
<li class="toctree-l1">
171+
172+
<a class="" href="../../16_优先级队列/priority_queue/">优先级队列</a>
173+
</li>
174+
160175
</ul>
161176
</div>
162177
&nbsp;

0 commit comments

Comments
 (0)