LeetCode：406. Queue Reconstruction by Height

题目描述：

406. Queue Reconstruction by Height

Medium

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]]

解：先对数组进行排序，然后遍历数组解决问题

        排序规则：① 身高降序，② 人数升序；（例：给出的case中排序后[[7,0], [7,1], [6,1], [5,1], [5,2], [4,4]]）

vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
    int n = people.size();
    if (n <= 1)
        return people;
    sort(people.begin(), people.end(), 
        [](auto &a, auto &b) {
        return (a[0] > b[0]) || (a[0] == b[0] && a[1] < b[1]);
    });
    int tall = 0;
    int count = 0;
    for (int i = 0; i < n; ++i) {
        tall = people[i][0];
        count = people[i][1];
        for (int j = 0; j < i && count >= 0; ++j) {
            if (count == 0) {
                count = people[i][1];
                for (int k = i; k > j && j >= 0; --k)
                people[k] = people[k - 1];
                people[j][0] = tall;
                people[j][1] = count;
                break;
            }
            else
                if (people[j][0] >= tall)
                    count--;
        }
    }
    return people;
}