LeetCode 1605 Find Valid Matrix Given Row and Column Sums (思维 构造 推荐)

You are given two arrays rowSum and colSum of non-negative integers where rowSum[i] is the sum of the elements in the ith row and colSum[j] is the sum of the elements of the jth column of a 2D matrix. In other words, you do not know the elements of the matrix, but you do know the sums of each row and column.

Find any matrix of non-negative integers of size rowSum.length x colSum.length that satisfies the rowSum and colSum requirements.

Return a 2D array representing any matrix that fulfills the requirements. It's guaranteed that at least one matrix that fulfills the requirements exists.

Example 1:

Input: rowSum = [3,8], colSum = [4,7]
Output: [[3,0],
         [1,7]]
Explanation: 
0th row: 3 + 0 = 3 == rowSum[0]
1st row: 1 + 7 = 8 == rowSum[1]
0th column: 3 + 1 = 4 == colSum[0]
1st column: 0 + 7 = 7 == colSum[1]
The row and column sums match, and all matrix elements are non-negative.
Another possible matrix is: [[1,2],
                             [3,5]]

Example 2:

Input: rowSum = [5,7,10], colSum = [8,6,8]
Output: [[0,5,0],
         [6,1,0],
         [2,0,8]]

Constraints:

• 1 <= rowSum.length, colSum.length <= 500
• 0 <= rowSum[i], colSum[i] <= 108
• sum(rows) == sum(columns)

题目链接：https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/

题目大意：告诉你一个矩阵的每行和每列的元素和，求一个满足条件的原矩阵，保证有解

题目分析：受到之前一道题的启发（https://leetcode.com/problems/two-city-scheduling/），也写了题解，不过用的不是最优做法，最优做法是让所有人都先到一个城市然后算将某个人放到另一个城市的代价。回到本题，将行列同时考虑有点无从下手，不妨先将行填上，即把行和的值全填到第一列，然后通过修正列和的方式构造答案，从上往下，从左往右枚举，若当前列的行前缀和已经超过该列期望的和，则将行值减掉累加部分，剩余部分继续给右边列

8ms，时间击败63.5%

class Solution {
    public int[][] restoreMatrix(int[] rowSum, int[] colSum) {
        int n = rowSum.length;
        int m = colSum.length;
        int[][] ans = new int[n][m];

        for (int j = 0; j < m; j++) {
            int sum = 0;
            for (int i = 0; i < n; i++) {
                if (sum + rowSum[i] >= colSum[j]) {
                    ans[i][j] = colSum[j] - sum;
                    rowSum[i] -= ans[i][j];
                    break;
                }
                sum += rowSum[i];
                ans[i][j] = rowSum[i];
                rowSum[i] = 0;
            }
        }
        return ans;
    }
}