把箱子放进仓库里 I

/*
 * 思路:
 * 1. 使用流来简化数组操作
 * 2. 计算每个仓库位置的最大可容纳高度
 * 3. 将箱子排序，并从末尾开始尝试放入仓库
 */
import java.util.Arrays;
import java.util.stream.IntStream;

public class BoxInWarehouseStream {
    public int maxBoxesInWarehouse(int[] boxes, int[] warehouse) {
        int[] minHeight = IntStream.range(0, warehouse.length)
                                   .map(i -> IntStream.range(0, i + 1)
                                                      .map(j -> warehouse[j])
                                                      .min()
                                                      .getAsInt())
                                   .toArray();
        Arrays.sort(boxes);
        int count = 0;
        int i = warehouse.length - 1;
        for (int j = 0; j < boxes.length && i >= 0; i--) {
            if (boxes[j] <= minHeight[i]) {
                count++;
                j++;
            }
        }
        return count;
    }
}