Update 406._Queue_Reconstruction_by_Height.md

Author: 0xkookoo

docs/Leetcode_Solutions/Python/406._Queue_Reconstruction_by_Height.md

@@ -1,15 +1,37 @@
-### 406. Queue Reconstruction by Height
+# 406. Queue Reconstruction by Height
 
-题目:
-<https://leetcode.com/problems/queue-reconstruction-by-height/>
+**<font color=red>难度: Medium</font>**
 
+## 刷题内容
 
-难度:
+> 原题连接
 
-Medium
+* https://leetcode.com/problems/queue-reconstruction-by-height/description/
 
+> 内容描述
+
+```
+
+Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.
+
+Note:
+The number of people is less than 1,100.
+
+
+Example
+
+Input:
+[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
+
+Output:
+[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
+```
+
+## 解题方案
+
+> 思路 1
+******- 时间复杂度: O(NlgN)******- 空间复杂度: O(1)******
 
-思路：
 People are only counting (in their k-value) taller or equal-height others standing in front of them. 
 So a smallest person is completely irrelevant for all taller ones. And of all smallest people, 
 the one standing most in the back is even completely irrelevant for everybody else. Nobody is counting that person. 
@@ -26,18 +48,20 @@ Sorting the people from the first-tallest to the last-smallest, and inserting th
 
 参考[stefan](https://leetcode.com/problems/queue-reconstruction-by-height/discuss/89359)
 
+不算返回结果res的话，空间复杂度为O(1)
+
 ```python
 class Solution(object):
     def reconstructQueue(self, people):
         """
         :type people: List[List[int]]
         :rtype: List[List[int]]
         """
-        people.sort(key=lambda (h, k): (-h, k))
-        queue = []
+        people.sort(key = lambda x: (-x[0], x[1]))
+        res = []
         for p in people:
-            queue.insert(p[1], p)
-        return queue
+            res.insert(p[1], p)
+        return res
 ```