aboutsummaryrefslogtreecommitdiff
path: root/other/queue_reconstruction.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/queue_reconstruction.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/queue_reconstruction.cpp')
-rw-r--r--other/queue_reconstruction.cpp20
1 files changed, 20 insertions, 0 deletions
diff --git a/other/queue_reconstruction.cpp b/other/queue_reconstruction.cpp
new file mode 100644
index 0000000..17ea0ea
--- /dev/null
+++ b/other/queue_reconstruction.cpp
@@ -0,0 +1,20 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ vector<vector<int>> reconstructQueue(vector<vector<int>> &people) {
+ sort(people.begin(), people.end(), cmp);
+ vector<vector<int>> ans;
+ for (int i = 0; i < people.size(); i++)
+ ans.insert(ans.begin() + people[i][1], people[i]);
+ return ans;
+ }
+
+private:
+ static bool cmp(vector<int> &p1, vector<int> &p2) {
+ if (p1[0] != p2[0])
+ return p1[0] > p2[0];
+ else
+ return p1[1] < p2[1];
+ }
+};