77# Jerry Chen <[email protected] >, 201788# Meng Du <[email protected] >, 201999# iceyasha <[email protected] >, 201910- # Freesand Leo <[email protected] >, 2019 10+ # Freesand Leo <[email protected] >, 2021 1111#
1212#, fuzzy
1313msgid ""
@@ -16,7 +16,7 @@ msgstr ""
1616"Report-Msgid-Bugs-To : \n "
1717"POT-Creation-Date : 2021-01-01 05:02+0000\n "
1818"PO-Revision-Date : 2017-02-16 23:13+0000\n "
19- "
Last-Translator :
Freesand Leo <[email protected] >, 2019 \n "
19+ "
Last-Translator :
Freesand Leo <[email protected] >, 2021 \n "
2020"Language-Team : Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n "
2121"MIME-Version : 1.0\n "
2222"Content-Type : text/plain; charset=UTF-8\n "
@@ -47,9 +47,9 @@ msgid ""
4747"elements are considered to be infinite. The interesting property of a heap "
4848"is that its smallest element is always the root, ``heap[0]``."
4949msgstr ""
50- "堆是一个二叉树,它的每个父节点的值都只会小于或大于所有孩子节点 (的值)。它使用了数组来实现:从零开始计数,对于所有的 *k* ,都有 ``heap[k] "
51- " <= heap[2*k+1]`` 和 ``heap[k] <= heap[2*k+2]``。 为了便于比较,不存在的元素被认为是无限大 。 "
52- "堆最有趣的特性在于最小的元素总是在根结点:``heap[0]``。"
50+ "堆是一个二叉树,它的每个父节点的值都只会小于或等于所有孩子节点 (的值)。 它使用了数组来实现:从零开始计数,对于所有的 *k* ,都有 "
51+ "``heap[k] <= heap[2*k+1]`` 和 ``heap[k] <= heap[2*k+2]``。 "
52+ "为了便于比较,不存在的元素被认为是无限大。 堆最有趣的特性在于最小的元素总是在根结点:``heap[0]``。"
5353
5454#: ../../library/heapq.rst:26
5555msgid ""
0 commit comments