406. Queue Reconstruction by Height
来源:互联网 发布:推荐les淘宝店 编辑:程序博客网 时间:2024/06/08 15:51
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]]
摘自
https://discuss.leetcode.com/topic/60394/easy-concept-with-python-c-java-solution
- Pick out tallest group of people and sort them in a subarray (S). Since there's no other groups of people taller than them, therefore each guy's index will be just as same as his k value.
- For 2nd tallest group (and the rest), insert each one of them into (S) by k value. So on and so forth.
E.g.
input: [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
subarray after step 1: [[7,0], [7,1]]
subarray after step 2: [[7,0], [6,1], [7,1]]
public class Solution { public static int[][] reconstructQueue(int[][] people) { Arrays.sort(people,new Comparator<int[]>(){ @Override public int compare(int[] o1, int[] o2){ return o1[0]!=o2[0]?-o1[0]+o2[0]:o1[1]-o2[1]; } }); List<int[]> res = new LinkedList<>(); for(int[] cur : people){ res.add(cur[1],cur); } return res.toArray(new int[people.length][]); }}
0 0
- 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
- 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
- Android工具类
- 链表增删查
- jQuery Mobile Data 属性
- UTF编码字符串的总字节数计算
- Android 联系人数据库contacts2.db介绍
- 406. Queue Reconstruction by Height
- /bin/bash: bison: command not found
- 你真的了解 load 方法么
- hdu 2203
- Android-AutoCompleteTextView
- iOS urlencoded 转码解码
- effective c++-让自己习惯c++
- 树状数组的两种运用
- Java类与类之间的5种关系及uml表示