Update 406._Queue_Reconstruction_by_Height.md

0xkookoo · web-flow · commit 7e3630498435 · 2018-09-29T14:56:12.000-05:00
diff --git a/docs/Leetcode_Solutions/Python/406._Queue_Reconstruction_by_Height.md b/docs/Leetcode_Solutions/Python/406._Queue_Reconstruction_by_Height.md
@@ -50,6 +50,8 @@ Sorting the people from the first-tallest to the last-smallest, and inserting th
 
 不算返回结果res的话，空间复杂度为O(1)
 
+beats 99.12%
+
 ```python
 class Solution(object):
     def reconstructQueue(self, people):
