LeetCode 406 - Queue Reconstruction by Height

原题：
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Example
Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

大致题意：
给一个被打乱的数组，每个元素表示一个人的高度+左边有多少个人不比自己矮。按照已知信息重排数组。

---

乍一看凭直觉觉得要先排序，按照身高先从小到大排，再按照左边比自己矮的人的数量反过来排（一般这种题都这样的套路）。然后就卡死了，因为不知道如何能一次性正确插入所有人。参考了一下这位大神写的算法，被震惊了。。。https://blog.csdn.net/camellhf/article/details/52671119
简单说就是，先排序之后，然后将左边人的数量作为offset倒序遍历插入新数组。实现起来非常无脑，但是能想出来比较困难。时间复杂度搜索O(nlogn) + 插入O(n^2), 空间复杂度O(n)。

class Solution {
public:
    /**
     * @param people: a random list of people
     * @return: the queue that be reconstructed
     */
    vector<vector<int>> reconstructQueue(vector<vector<int>> &people) {
        // write your code here
        int n = people.size();
        if (n == 0) return people;
        vector<vector<int>> res;
        sort(people.begin(), people.end(), [](const vector<int> &p1, const vector<int> &p2){
           if (p1[0] != p2[0]) {
               return p1[0] > p2[0];
           } else {
               return p1[1] < p2[1];
           }
        });
        for (int i = 0; i < n; i++) {
            int offset = people[i][1];
            res.insert(res.begin() + offset, people[i]);
        }
        return res;
    }
};

Lintcode链接：
https://lintcode.com/problem/queue-reconstruction-by-height/description

有点贪心的思路，确实很难，有狗的tag所以还是得刷。