- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- 406. Queue Reconstruction by Hei
- Leetcode【406、763、861、1094】
class Solution(object):
def reconstructQueue(self, people):
"""
:type people: List[List[int]]
:rtype: List[List[int]]
"""
res=[]
people.sort(key=lambda x:x[1])
people.sort(key=lambda x:-x[0])
for p in people:
res.insert(p[1],p)
return res
网友评论