LeetCode #406: Queue Reconstruction by Height

最新推荐文章于 2022-07-30 22:49:52 发布

junchen1992

最新推荐文章于 2022-07-30 22:49:52 发布

阅读量584

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 LeetCode 文章标签：贪心

本文链接：https://blog.youkuaiyun.com/junchen1992/article/details/52953352

算法同时被 2 个专栏收录

141 篇文章

订阅专栏

LeetCode

129 篇文章

订阅专栏

本文介绍了一种基于贪心策略的队列重构算法。该算法通过排序和插入操作，解决了根据人员身高及其前面更高或同高人数来重建队列的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Statement

(Source) 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]]

Solution

Tags: Greedy.
This question is a direct application of Greedy based on sorting. Sort the people p in the queue by h (descending) and then by k (ascending) first, then iterating through the first people to the last people and insert them into the temporary correct positions. The result is final when the scan ends.

class Solution(object):
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        res = []
        people.sort(key=lambda (x, y): (-x, y))
        for p in people:
            res.insert(p[1], p)
        return res