LeetCode(力扣)406. 根据身高重建队列Python

题目链接

https://leetcode.cn/problems/queue-reconstruction-by-height/

代码

class Solution:
    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
        people.sort(key =lambda x: (-x[0], x[1]))
        que = []
        for p in people:
            que.insert(p[1], p)
        return que
1
2
3
4
5
6
7