AM 1252. Queue Reconstruction by Height

Code(Language:C++) (Judger:cloudjudge-cluster-4)

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
        sort(people.begin(), people.end(), comparator);
        vector<vector<int>> resultVector;
        for (vector<int> cur : people) {
            resultVector.insert(resultVector.begin() + cur[1], cur);
        }
        return resultVector;
    }
    
    static bool comparator(vector<int> p1, vector<int> p2) {
        return (p1[0] > p2[0]) || (p1[0] == p2[0] && p1[1] < p2[1]);
    }
};

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20