#1605

Find Valid Matrix Given Row and Column Sums

pupil · 415 · lc medium +25 · failed · 82.7% accepted · 2,198 likes · top 94%

Description

You are given non-negative integer arrays rowSum and colSum representing the desired row and column totals of an unknown matrix. Construct any matrix of non-negative integers with these row and column sums. A valid solution always 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]]

Code

1

2

3

class Solution:
    def restoreMatrix(self, rowSum: List[int], colSum: List[int]) -> List[List[int]]:

class Solution:
    def restoreMatrix(self, rowSum: List[int], colSum: List[int]) -> List[List[int]]: