根据身高重建队列

/* 
 * Problem Description: 
 * Given a list of people with their heights and the number of people in front of them who have a height greater than or equal to theirs, reconstruct the queue. 
 * Approach: 
 * 1. Use Java Stream to sort and insert elements. 
 * 2. The sorting and insertion follow the same logic as in the traditional method.
 */
 
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
 
public class Solution {
    public int[][] reconstructQueue(int[][] people) {
        // Sort the people array using Java Stream
        List<int[]> sortedPeople = Arrays.stream(people)
                .sorted((a, b) -> {
                    if (a[0] == b[0]) {
                        return a[1] - b[1];
                    } else {
                        return b[0] - a[0];
                    }
                })
                .collect(Collectors.toList());
 
        // Create a list to hold the final queue
        List<int[]> queue = new ArrayList<>();
 
        // Insert each person into the queue at the index specified by their k-value
        sortedPeople.forEach(person -> queue.add(person[1], person));
 
        // Convert the list back to an array
        return queue.toArray(new int[queue.size()][]);
    }
}