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

题意：对于给定的(h, k)进行排序，其中h是人的身高，k是在当前升高为h的之前的人，且身高大于等于h；

思路：先按照h逆序排列，当h相同时，对k升序排列；

class Solution:
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        
        def key_sort(people):
            return -people[0], people[1]
        
        people.sort(key=key_sort)
        ans = []
        for i in people:
            ans.insert(i[1], i)
        
        return ans

注意：利用函数key_sort()中返回负h和正k，来实现降序和升序；