※ 引述《DJYOSHITAKA (franchouchouISBEST)》之銘言：
: 看你們說
: 把最大能填的填進去
: 我填了 舊過了
: ==
: def restoreMatrix(self, rowSum: List[int], colSum: List[int]) ->
: List[List[int]]:
: m, n = len(rowSum), len(colSum)
: ans = [[0 for _ in range(n)] for _ in range(m)]
: for i in range(m):
: for j in range(n):
: ans[i][j] = min(rowSum[i], colSum[j])
: rowSum[i] -= ans[i][j]
: colSum[j] -= ans[i][j]
: return ans
思路:
看板上作法
填最小的 然後把填進去的扣掉
Python Code:
class Solution:
def restoreMatrix(self, rowSum: List[int], colSum: List[int]) ->
List[List[int]]:
m = len(rowSum)
n = len(colSum)
result = [[0] * n for _ in range(m)]
for i in range(m):
for j in range(n):
result[i][j] = min(rowSum[i],colSum[j])
rowSum[i] -= result[i][j]
colSum[j] -= result[i][j]
return result