LeetCode 406. Queue Reconstruction by Height

题目

代码

class Solution:
    def insert(self, people, fromindex, toindex):
        tmp = people[fromindex]
        for i in range(toindex + 1, fromindex + 1)[::-1]:
            people[i] = people[i - 1]
        people[toindex] = tmp
        return people
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        people = sorted(people, key = lambda x: (-x[0], x[1]))
        i = 0; length = len(people)
        print(people)
        while i < length:
            index = people[i][1]
            self.insert(people, i, index)
            i += 1
        return people