Merge pull request yidao620c#202 from Huang-Jinxian/patch-1

yidao620c · web-flow · commit 941c3c7bbd9f · 2017-10-11T11:15:40.000+08:00
命令错误
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]
     >>>
 
