LeetCode:406. Queue Reconstruction by Height

LeetCode:406. Queue Reconstruction by Height

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]]

假设数组[a,b]表示一个人的身高以及前面比他高（包含相同身高）的人的个数。给出一个未排序的数组，按照这个规则重新排序数组。

思路一：回溯法

每次从数组中选出一个元素，如果符合规则，则插入到结果数组中，如果不符合，则将结果数组回退一个元素，重新选择一个元素判断是否符合规则，依次重新排序整个数组。

思路二：先排序，后插队

假设候选队列为 A，已经站好队的队列为 B.

从 A 里挑身高最高的人 x 出来，插入到 B. 因为 B 中每个人的身高都比 x 要高，因此 x 插入的位置，就是看 x 前面应该有多少人就行了。比如 x 前面有 5 个人，那 x 就插入到队列 B 的第 5 个位置。

Python 代码实现

class Solution(object):
    def reconstructQueue(self, people):
        if not people: return []

        # obtain everyone's info
        # key=height, value=k-value, index in original array
        peopledct, height, res = {}, [], []
        
        for i in range(len(people)):
            p = people[i]
            if p[0] in peopledct:
                peopledct[p[0]] += (p[1], i),
            else:
                peopledct[p[0]] = [(p[1], i)]
                height += p[0],

        height.sort()      # here are different heights we have

        # sort from the tallest group
        for h in height[::-1]:
            peopledct[h].sort()
            for p in peopledct[h]:
                res.insert(p[0], people[p[1]])

        return res

以 [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] 为例：

1. 先以身高h降序，人数k升序，对原数组进行排序得 ： [7,0], [7,1], [6,1], [5,0], [5,2], [4,4]

2. 再一个一个插入。

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

---

THE END.