update: 406

Author: hijiangtao

README.md

@@ -150,6 +150,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)                                                                             | [JavaScript](./src/shuffle-an-array/res.js)                                                                           | Medium     |
 | 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | [JavaScript](./src/longest-substring-with-at-least-k-repeating-characters/res.js)                                     | Medium     |
 | 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)                                                                         | [JavaScript](./src/sum-of-left-leaves/res.js)                                                                         | Easy       |
+| 406 | [queue-reconstruction-by-height](https://leetcode.com/problems/queue-reconstruction-by-height/)                                                 | [TypeScript](./src/queue-reconstruction-by-height/res.ts)                                                             | Medium     |
 | 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)                                                                           | [JavaScript](./src/arithmetic-slices/res.js)                                                                          | Medium     |
 | 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)                                                         | [JavaScript](./src/partition-equal-subset-sum/res.js)                                                                 | Medium     |
 | 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)                               | [JavaScript](./src/longest-repeating-character-replacement/res.js)                                                    | Medium     |

src/queue-reconstruction-by-height/res.ts

@@ -0,0 +1,19 @@
+/**
+ * 先按照高度降序排列，再按照人数升序排列
+ * 然后依次插入，每次插入时，之前插入过的元素都会比当前元素要高
+ * @param people
+ */
+function reconstructQueue(people: number[][]): number[][] {
+    people.sort((a, b) => (b[0] - a[0]) || (a[1] - b[1]));
+
+    let result: number[][] = [];
+    people.forEach(item => {
+        if (item[1] >= result.length) {
+            result.push(item);
+        } else {
+            result = [...result.slice(0, item[1]), item, ...result.slice(item[1])];
+        }
+    });
+
+    return result;
+};