Create queue_reconstruction_by_height.py

Author: frank731

leetcode/python/queue_reconstruction_by_height.py

@@ -0,0 +1,7 @@
+class Solution:
+    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
+        people.sort(key=lambda person: (-person[0], person[1]))
+        sorted_queue = []
+        for person in people:
+            sorted_queue.insert(person[1], person)
+        return sorted_queue