题目
代码记录
方法一
class Solution:
def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
people.sort(key=lambda x:x[0]-1e-8*x[1])
people_num=len(people)
empty_list=[i for i in range(people_num)]
res=[[] for i in range(people_num)]
for i in range(people_num):
cur=people[i]
res[empty_list[cur[1]]]=cur
empty_list.remove(empty_list[cur[1]])
return res