LeetCode--406. Queue Reconstruction by Height

LeetCode--406. Queue Reconstruction by Height

Description:

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

Solution:

首先要根据people的height（h）进行排序：按照h从大到小的顺序排列，如果遇到h相等的，根据k，按照k从小到大的顺序来；

根据排列好的顺序，由k决定people是前移、后移或者位置不动，最后得到最终的序列。

class Solution {
public:
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        vector<pair<int, int>>result;
        sort(people.begin(), people.end(),[](pair<int, int>p1, pair<int, int>p2){
			return p1.first>p2.first || (p1.first==p2.first && p1.second<p2.second);});
        for(auto e : people) {
            bool add = true;
            int count = 0;
            for(int i = 0; i < result.size(); i++)  {
                if(result[i].first >= e.first) {
                	count++;
                }              
                if(count>e.second) {
                    result.insert(result.begin()+i, e);
                    add = false;
                    break;
                }
            }
            if(add){
            	result.push_back(e);	
            } 
        }
        return result;
    }
};

Test：

Your input

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

Your answer

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

Expected answer

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