406-根据身高重建队列

public int[][] reconstructQueue(int[][] people) {
    //身高从低到高排序，前面人数从大到小排序
    Arrays.sort(people, (o1, o2) -> {
        if (o1[0] != o2[0]) return o1[0] - o2[0];
        else return o2[1] - o1[1];
    });
    //从后往前调整顺序，people[i, j]表示people[i]往后调整j个
    for (int i = people.length - 2; i >= 0; i--) {
        int time = people[i][1];
        int[] temp = people[i];
        for (int j = i; j < i + time; j++) {
            people[j] = people[j + 1];
        }
        people[i + time] = temp;
    }
    return people;
}