Solution as on 04-07-2022 09:00 pm

Author: knockcat

0406. Queue Reconstruction by Height.cpp

@@ -0,0 +1,26 @@
+// 406.✅ Queue Reconstruction by Height
+
+class Solution
+{
+public:
+    vector<vector<int>> reconstructQueue(vector<vector<int>> &people)
+    {
+        int n = people.size();
+
+        sort(people.begin(), people.end(), [&](vector<int> &a, vector<int> &b)
+             {
+            if(a[0] == b[0])
+                return a[1] < b[1];
+            return a[0] > b[0]; });
+
+        vector<vector<int>> res;
+
+        for (int i = 0; i < n; ++i)
+        {
+            int idx = people[i][1];
+            res.insert(res.begin() + idx, people[i]);
+        }
+
+        return res;
+    }
+};