leetcode june challenge

Author: surikunal

june_challenge/week_1/queueReconstructionByHeight.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+class Solution
+{
+    static bool comparator(vector<int> &a, vector<int> &b)
+    {
+        if (a[0] == b[0])
+            return a[1] < b[1];
+        return a[0] < b[0];
+    }
+
+public:
+    vector<vector<int>> reconstructQueue(vector<vector<int>> &people)
+    {
+        std::ios::sync_with_stdio(false);
+        cin.tie(NULL);
+        cout.tie(NULL);
+        int n = people.size();
+        sort(people.begin(), people.end(), comparator);
+        vector<vector<int>> ans(n, vector<int>(2, -1));
+        for (int i = 0; i < n; i++)
+        {
+            int count = people[i][1];
+            for (int j = 0; j < n; j++)
+            {
+                if (ans[j][0] == -1 && count == 0)
+                {
+                    ans[j][0] = people[i][0];
+                    ans[j][1] = people[i][1];
+                    break;
+                }
+                else if (ans[j][0] == -1 || ans[j][0] >= people[i][0])
+                {
+                    count -= 1;
+                }
+            }
+        }
+        return ans;
+    }
+};