LeetCode 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.

 

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

-------------------------------------------------------------------------------

这是一道很好的题目，最开始想按照k (the number of people in front of this person)排序，但是想了很久未果。后来发现可以按照高度降序排，前面有几个人插入在第几位，比他高的不受影响，比他低的后面再说。。。。代码非常简单：

class Solution:
    def reconstructQueue(self, people):
        people.sort(key=lambda x:(-x[0],x[1]))
        l = len(people)
        res = []
        for i in range(l):
            before = people[i][1]
            res.insert(before, people[i])
        return res
s = Solution()
print(s.reconstructQueue([[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]))