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.

思路

首先把h按大到小排序，同时h相等的情况下，按k从小到大排序。然后逐个插入，其中k为插入的位置。这道题首先肯定是排序了，至于为什么这样排，只能自己在纸上摸索。

代码

class Solution {
public:
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        Qsort(people,0,people.size()-1);
        vector<pair<int, int>> result;
        for (auto a : people) {
            result.insert(result.begin() + a.second, a);
        }
        return result;
    }


    void Qsort(vector<pair<int, int>>& A, int low, int high) {
        if (low >= high)
        {
            return;
        }
        int first = low;
        int last = high;
        pair<int, int> key = A[first];/*用字表的第一个记录作为枢轴*/

        while (first < last)
        {
            while (first < last && (A[last].first < key.first|| (A[last].first == key.first&&A[last].second>=key.second)))
            {
                --last;
            }

            A[first] = A[last];/*将比第一个大的移到低端*/

            while (first < last && (A[first].first > key.first || (A[first].first == key.first&&A[first].second <= key.second)))
            {
                ++first;
            }

            A[last] = A[first];
            /*将比第一个小的移到高端*/
        }
        A[first]= key;/*枢轴记录到位*/
        Qsort(A, low, first - 1);
        Qsort(A, first + 1, high);
    }
};