[Leetcode] 406. Queue Reconstruction by Height

문제 링크

me

faillog
reverse=True로 sort함

solution

heap

import heapq
heapPeople=[]
for p in people: heapq.heappush(heapPeople,(-p[0],p[1]))

result=[]
while heapPeople:
    person=heapq.heappop(heapPeople)
    result.insert(person[1],[-person[0],person[1]])
print(result)

sort

# people.sort(reverse=True) # 그냥 역순 정렬하면 두번째 인덱스도 역순 정렬되니깐 문제 조건과 맞지 않음
people.sort(key = lambda x: (-x[0], x[1]))
result=[]
for p in people:
    result.insert(p[1],p)
print(result)