406-以高度对队列重排

Description

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

问题描述

假设你有一个乱序的列表， 列表中的元素表示站成一队的人。每个人由一对(h, k)表示， h为人的高度， k为站在该人之前身高大于等于h的人的个数。重建队列(使得每个元素中的k成立)

问题分析

将people根据身高逆序，若身高相同，则根据k顺序。遍历people，维护一个list，k即为插入list的位置。

解法

class Solution {
      public int[][] reconstructQueue(int[][] people) {
        if(people == null || people.length == 0 || people[0].length == 0)   return new int[0][0];

        Arrays.sort(people, new Comparator<int[]>(){
            public int compare(int[] a, int[] b) {
                if (b[0] == a[0]) return a[1] - b[1];
                return b[0] - a[0];
            }
        });

        int n = people.length;
        ArrayList<int[]> tmp = new ArrayList<>();

        for(int i = 0; i < n; i++)  tmp.add(people[i][1], new int[]{people[i][0], people[i][1]});

        int[][] res = new int[people.length][2];
        int i = 0;
        for(int[] k : tmp){
            res[i][0] = k[0];
            res[i++][1] = k[1];
        }

        return res;
    }
}