给定行和列的和求可行矩阵

/*
 * Solution Idea using Java Streams:
 * The core idea remains the same: fill the matrix with the minimum possible values.
 * However, this implementation will use Java Streams where possible for iteration.
 */

import java.util.Arrays;

public class Solution {
    public int[][] restoreMatrix(int[] rowSum, int[] colSum) {
        int rows = rowSum.length;
        int cols = colSum.length;
        int[][] matrix = new int[rows][cols];

        Arrays.stream(matrix).forEach(row -> Arrays.fill(row, 0));

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                int minValue = Math.min(rowSum[i], colSum[j]);
                matrix[i][j] = minValue;
                rowSum[i] -= minValue;
                colSum[j] -= minValue;
            }
        }
        return matrix;
    }
}