Leetcode 406. Queue Reconstruction by Height

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.
Note:
The number of people is less than 1,100.
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]]

题目大意：
给定一个随机的排队队列。 每个人都用一对整数（h，k）描述，其中h是人的身高，k是队列中此人之前的身高大于或等于h的人数。 编写算法以重建队列。

解题思路：
采用贪心策略，因为k的制约要判断队中有多少个元素比当前元素大，所以身高高的优先。因此，对队列按照身高从高到低，若身高相同则k从小到大的原则排序，再遍历这个队列，以每个元素的k值作为插入位置。代码1使用了额外空间，代码2没有但速度较慢。时间复杂度为O(nlogn)。

代码1：

class Solution {
    static int comp(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) {
        vector<vector<int>> res;
        sort(people.begin(), people.end(), comp);
        for(int i = 0; i < people.size(); i++)
            res.insert(res.begin() + people[i][1], people[i]);
        return res;
    }
};

代码2：

class Solution {
    static int comp(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) {
        sort(people.begin(), people.end(), comp);
        for(int i = 0; i < people.size(); i++)
        {
            auto p = people[i];
            if(p[1] != i)
            {
                people.erase(people.begin() + i);
                people.insert(people.begin() + p[1], p);
            }
        }
        return people;
    }
};