【LeetCode】406.Queue Reconstruction by Height(Medium)解题报告

【LeetCode】406.Queue Reconstruction by Height(Medium)解题报告

题目地址：https://leetcode.com/problems/queue-reconstruction-by-height/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]]

Solution:

//三种解法，下面是很巧的一种,先排序后插入，第一个数降序，第二个数升序。
//time : O(n^2)
//space : O(n)
class Solution {
    public int[][] reconstructQueue(int[][] people) {
        if(people == null || people.length ==0 ||people[0].length==0){
            return new int[0][0];
        }
        List<int[]> res = new ArrayList<>();
        Arrays.sort(people,(a,b)->(a[0]==b[0]?a[1]-b[1]:b[0]-a[0]));
        for(int[] cur : people){
            res.add(cur[1],cur);
        }
        return res.toArray(new int[people.length][]);   
    }
}

Date：2018年3月6日