406. 根据身高重建队列

Author: w2xi

README.md

@@ -133,6 +133,7 @@
 |389|[找不同](https://leetcode.cn/problems/find-the-difference/)|[JavaScript](./algorithms/find-the-difference.js)|Easy|
 |396|[旋转函数](https://leetcode.cn/problems/rotate-function/)|[JavaScript](./algorithms/rotate-function.js)|Medium|
 |404|[左叶子之和](https://leetcode.cn/problems/sum-of-left-leaves/)|[JavaScript](./algorithms/sum-of-left-leaves.js)|Easy|
+|406|[根据身高重建队列](https://leetcode.cn/problems/queue-reconstruction-by-height/)|[JavaScript](./algorithms/queue-reconstruction-by-height.js)|Medium|
 |412|[Fizz Buzz](https://leetcode.cn/problems/fizz-buzz/)|[JavaScript](./algorithms/fizz-buzz.js)|Easy|
 |414|[第三大的数](https://leetcode.cn/problems/third-maximum-number/)|[JavaScript](./algorithms/third-maximum-number.js)|Easy|
 |442|[数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/)|[JavaScript](./algorithms/find-all-duplicates-in-an-array.js)|Medium|

algorithms/queue-reconstruction-by-height.js

@@ -0,0 +1,22 @@
+/**
+ * 406. 根据身高重建队列
+ * @param {number[][]} people
+ * @return {number[][]}
+ */
+var reconstructQueue = function (people) {
+  // 按照身高从高到低排序
+  people.sort((a, b) => {
+    if (a[0] === b[0]) {
+      return a[1] - b[1];
+    }
+    return b[0] - a[0];
+  });
+
+  const result = [];
+  for (let i = 0; i < people.length; i++) {
+    // 依次插队
+    result.splice(people[i][1], 0, people[i]);
+  }
+
+  return result;
+};