class Solution:
def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
people = sorted(people, key = lambda x: [-x[0], x[1]])
res = []
for p in people:
if len(res) <= p[1]:
res.append(p)
else:
res.insert(p[1], p)
return res
时间复杂度:(O(n^2)) 排序O(nlog(n))+ 遍历n*insert n
空间复杂度O(n)