LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.


Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham
class Solution {
 public:
  vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
    sort(begin(people), end(people), [](vector<int>& x, vector<int>& y) {
      return tie(y[0], x[1]) < tie(x[0], y[1]);
    });
    vector<vector<int>> res;
    for (auto& x : people) {
      res.emplace(begin(res) + x[1], x);
    }
    return res;
  }
};