命令错误

Huang-Jinxian · web-flow · commit 36942f100842 · 2017-10-10T01:13:25.000-05:00
进行堆排序得是heap，而不是nums，所以输出的应该是heap
diff --git a/source/c01/p04_find_largest_or_smallest_n_items.rst b/source/c01/p04_find_largest_or_smallest_n_items.rst
@@ -48,7 +48,7 @@ heapq 模块有两个函数：``nlargest()`` 和 ``nsmallest()`` 可以完美解
     >>> import heapq
     >>> heap = list(nums)
     >>> heapq.heapify(heap)
-    >>> nums
+    >>> heap
     [-4, 2, 1, 23, 7, 2, 18, 23, 42, 37, 8]
     >>>
 
