From 4d91c78e1ea6e1d51a5a73b825762cf6097a1e96 Mon Sep 17 00:00:00 2001
From: Asterisk <44215173+GHumorBS@users.noreply.github.com>
Date: Tue, 7 Sep 2021 17:00:25 +0800
Subject: [PATCH] =?UTF-8?q?Update=200406.=E6=A0=B9=E6=8D=AE=E8=BA=AB?=
 =?UTF-8?q?=E9=AB=98=E9=87=8D=E5=BB=BA=E9=98=9F=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

补充一下python注释，更好理解python语法
---
 problems/0406.根据身高重建队列.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/problems/0406.根据身高重建队列.md b/problems/0406.根据身高重建队列.md
index 6d8f703b..bd27b1b2 100644
--- a/problems/0406.根据身高重建队列.md
+++ b/problems/0406.根据身高重建队列.md
@@ -209,8 +209,13 @@ Python：
 ```python
 class Solution:
     def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
+    	# 先按照h维度的身高顺序从高到低排序。确定第一个维度
+        # lambda返回的是一个元组：当-x[0](维度h）相同时，再根据x[1]（维度k）从小到大排序
         people.sort(key=lambda x: (-x[0], x[1]))
         que = []
+	
+	# 根据每个元素的第二个维度k，贪心算法，进行插入
+        # people已经排序过了：同一高度时k值小的排前面。
         for p in people:
             que.insert(p[1], p)
         return que