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

这道题可以先根据数值对的第一个值进行降序排序,如果两个值相等的话,根据数值对的第二个值进行升序排序,然后再遍历一遍数组,根据数值对的第二个元素插入到返回的数组中即可。
代码:
运行时间截图:

共有 0 条评论

Top