406. Queue Reconstruction by Height Difficulty : Medium
来源:互联网 发布:c语言左移和右移 编辑:程序博客网 时间:2024/06/05 01:19
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.
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版
Examplequeue = []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
- 406. Queue Reconstruction by Height Difficulty : Medium
- 406. Queue Reconstruction by Height (Medium)
- LeetCode 406. Queue Reconstruction by Height (Medium)
- Leetcode 406. Queue Reconstruction by Height[Medium]
- [Medium]Queue Reconstruction by Height
- LeetCode解题报告 406. Queue Reconstruction by Height [medium]
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- Java集合框架的一些总结
- 码云上传小工具
- 四则运算练习器
- Redis事务详解
- 模板类与类模板、函数模板与模板函数等的区别
- 406. Queue Reconstruction by Height Difficulty : Medium
- SpringMVC快速入门记录(一)
- HDU 1874 畅通工程续
- 移动Web开发Day1
- [YTU](3019)螺旋方阵
- oracle排序
- Hibernate一对一注解,一对多注解
- 好好准备找工作
- this关键字的应用