Deployed 19d2ec2 with MkDocs version: 1.0.4

Author: PegasusWang

03_链表/__pycache__/linked_list.cpython-36-PYTEST.pyc

@@ -119,6 +119,22 @@ def clear(self):
         self.length = 0
         self.tailnode = None
 
+    def reverse(self):
+        """反转链表"""
+        curnode = self.root.next
+        self.tailnode = curnode  # 记得更新 tailnode，多了这个属性处理起来经常忘记
+        prevnode = None
+
+        while curnode:
+            nextnode = curnode.next
+            curnode.next = prevnode
+
+            if nextnode is None:
+                self.root.next = curnode
+
+            prevnode = curnode
+            curnode = nextnode
+
 
 def test_linked_list():
     ll = LinkedList()
@@ -169,6 +185,16 @@ def test_linked_list_remove():
     ll.remove(7)
     print(list(ll))
 
+
+def test_linked_list_reverse():
+    ll = LinkedList()
+    n = 10
+    for i in range(n):
+        ll.append(i)
+    ll.reverse()
+    assert list(ll) == list(reversed(range(n)))
+
+
 def test_linked_list_append():
     ll = LinkedList()
     ll.appendleft(1)
@@ -179,3 +205,4 @@ def test_linked_list_append():
 if __name__ == '__main__':
     test_linked_list()
     test_linked_list_append()
+    test_linked_list_reverse()

03_链表/linked_list.py

@@ -123,3 +123,18 @@ def test_heapsort_reverse():
     l = list(range(10))
     random.shuffle(l)
     assert heapsort_reverse(l) == sorted(l, reverse=True)
+
+
+def heapsort_use_heapq(iterable):
+    from heapq import heappush, heappop
+    items = []
+    for value in iterable:
+        heappush(items, value)
+    return [heappop(items) for i in range(len(items))]
+
+
+def test_heapsort_use_heapq():
+    import random
+    l = list(range(10))
+    random.shuffle(l)
+    assert heapsort_use_heapq(l) == sorted(l)

15_堆与堆排序/__pycache__/heap_and_heapsort.cpython-36-PYTEST.pyc

@@ -174,6 +174,9 @@
     <li class="toctree-l2"><a href="#_7">延伸阅读</a></li>
 
 
+    <li class="toctree-l2"><a href="#leetcode">Leetcode</a></li>
+    
+
     </ul>
 	    </li>
 
@@ -346,7 +349,7 @@ <h1 id="_5">实现堆排序</h1>
 </code></pre>
 
 <h1 id="python-heapq">python 里的 heapq</h1>
-<p>python 其实自带了 heapq 模块，用来实现堆的相关操作，原理是类似的。请你阅读相关文档。</p>
+<p>python 其实自带了 heapq 模块，用来实现堆的相关操作，原理是类似的。请你阅读相关文档并使用内置的 heapq 模块完成堆排序。</p>
 <h1 id="_6">练习题</h1>
 <ul>
 <li>这里我用最大堆实现了一个 heapsort_reverse 函数，请你实现一个正序排序的函数。似乎不止一种方式</li>
@@ -360,6 +363,8 @@ <h1 id="_7">延伸阅读</h1>
 <li>《Data Structures and Algorithms in Python》 13.5 节 Heapsort</li>
 <li>阅读 Python heapq 模块的文档</li>
 </ul>
+<h1 id="leetcode">Leetcode</h1>
+<p>合并 k 个有序链表 https://leetcode.com/problems/merge-k-sorted-lists/description/</p>
 
             </div>
           </div>

15_堆与堆排序/heap_and_heapsort.py

@@ -528,5 +528,5 @@ <h2 id="_20">本电子书制作和写作方式</h2>
 
 <!--
 MkDocs version : 1.0.4
-Build Date UTC : 2018-12-18 02:39:15
+Build Date UTC : 2018-12-18 09:08:24
 -->