https://leetcode.cn/problems/queue-reconstruction-by-height/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/queue-reconstruction-by-height/
+
 https://leetcode.cn/problems/design-file-system/
 
 https://leetcode.cn/problems/find-duplicate-file-in-system/

queue-reconstruction-by-height/index.ts

@@ -0,0 +1,15 @@
+export default function reconstructQueue(people: number[][]): number[][] {
+    const queue: number[][] = [];
+    people.sort((a, b) => {
+        if (b[0] !== a[0]) {
+            return b[0] - a[0];
+        } else {
+            return a[1] - b[1];
+        }
+    });
+
+    for (let i = 0; i < people.length; i++) {
+        queue.splice(people[i][1], 0, people[i]);
+    }
+    return queue;
+}