python leetcode 406. Queue Reconstruction by Height

要尽量保证大的h在后面 所以进行如下
people = sorted(people, key=lambda people:(-people[0],people[1])) h降序 k降序
再遍历进行插入操作，插入位置为people[i][1]能保证符合题意 举例说明
people=[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
people = sorted(people, key=lambda people:(-people[0],people[1]))
此时people=[[7, 0], [7, 1], [6, 1], [5, 0], [5, 2], [4, 4]]
循环时res结果
[[7, 0]]
[[7, 0], [7, 1]]
[[7, 0],[6, 1], [7, 1]]
[[5, 0], [7, 0],[6, 1], [7, 1]]
[[5, 0], [7, 0],[5, 2],[6, 1], [7, 1]]
[[5, 0], [7, 0],[5, 2],[6, 1], [4, 4],[7, 1]]

class Solution(object):
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        if people ==[]:
            return []
        people = sorted(people, key=lambda people:(-people[0],people[1]))
        res=[people[0]]
        for i in range(1,len(people)):
            res.insert(people[i][1],people[i])
        return res