LeetCode406. Queue Reconstruction by Height

406. Queue Reconstruction by Height

让身高按照降序排列，高的在前面，同身高的情况下让要求前面人数人少的在前面

import java.util.List;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;

public class LeetCode406 {
    public int[][] reconstructQueue(int[][] people) {
        if(people.length == 0) return people;
        Arrays.sort(people, new Comparator<int[]>() {
            public int compare(int[] o1, int[] o2){
                return o1[0] == o2[0]? o1[1] - o2[1] : o2[0] - o1[0];
            }
        });
        List<int[]> list = new LinkedList<>();
        for(int[] cur : people){
            list.add(cur[1], cur);    //list.add(index,element)将element增加在指定位置index处
        }
        return list.toArray(new int[people.length][2]);
    }  
}