Leetcode 1605. Find Valid Matrix Given Row and Column Sums

[Woodyiiiiiii]

这道题就是贪心。一般这种类型也的确是要用贪心，没有DP也没有其他方法。

每个单元都充分利用colSum和rowSum。然后更新colSum或者rowSum。

class Solution {
    public int[][] restoreMatrix(int[] rowSum, int[] colSum) {
        int m = rowSum.length, n = colSum.length;
        int[][] ans = new int[m][n];
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                ans[i][j] = Math.min(rowSum[i], colSum[j]);
                rowSum[i] -= ans[i][j];
                colSum[j] -= ans[i][j];
            }
        }
        return ans;
    }
}

---

• 1605. Find Valid Matrix Given Row and Column Sums