1605 - Find Valid Matrix Given Row and Column Sums
JAVA
class Solution { public int[][] restoreMatrix(int[] rowSum, int[] colSum) { int m = rowSum.length; int n = colSum.length; int[][] ans = new int[m][n]; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { int x = Math.min(rowSum[i], colSum[j]); ans[i][j] = x; rowSum[i] -= x; colSum[j] -= x; } } return ans; } }
C++
class Solution { public: vector<vector<int>> restoreMatrix(vector<int>& rowSum, vector<int>& colSum) { int m = rowSum.size(), n = colSum.size(); vector<vector<int>> ans(m, vector<int>(n)); for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { int x = min(rowSum[i], colSum[j]); ans[i][j] = x; rowSum[i] -= x; colSum[j] -= x; } } return ans; } };
Comments
Post a Comment