406. Queue Reconstruction by Height Difficulty : Medium

最新推荐文章于 2021-01-14 23:26:49 发布

会编程的靓仔

最新推荐文章于 2021-01-14 23:26:49 发布

阅读量195

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/Vampirelzl/article/details/78197615

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Note:
The number of people is less than 1,100.

Example

Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

算法分析：先将人们按身高降序排列，如果身高相同就按k升序排列。然后按照k是否与下标相等，来决定插入新数组的位置。如果k与下标i相等，就表示前面有i个身高不低于自己的人，符合排列的规则，直接把他插入新数组i的位置；如果k与下标不相等，就表示排列的顺序不对，则应该把他插入到新数组下标为k的位置。C语言中题目给定的参数没看懂，只有Python版

Example
queue = []
queue = [[7, 0]]
queue = [[7, 0], [7, 1]]
queue = [[7, 0], [6, 1], [7, 1]]
queue = [[5, 0], [7, 0], [6, 1], [7, 1]]
queue = [[5, 0], [7, 0], [5, 2], [6, 1], [7, 1]]
queue = [[5, 0], [7, 0], [5, 2], [6, 1], [4, 4], [7, 1]]

Python版

class Solution(object):
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        ret = []
        for q in sorted(people, key=lambda x: (-x[0], x[1])):
            ret.insert(q[1], q)
        return ret