leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0406.cpp (427B)

0 class Solution { 1 public: 2 vector<vector<int>> reconstructQueue(vector<vector<int>> &people) { 3 sort(begin(people), end(people), 4 [](const auto &a, const auto &b) { return a[0] > b[0] || (a[0] == b[0] && a[1] < b[1]); }); 5 vector<vector<int>> res; 6 res.reserve(people.size()); 7 for (const auto &p : people) 8 res.insert(res.begin() + p[1], p); 9 return res; 10 } 11 };