leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1605.cpp (442B)

0 class Solution { 1 public: 2 vector<vector<int>> restoreMatrix(vector<int> &row, vector<int> &col) { 3 int m = row.size(), n = col.size(); 4 vector<vector<int>> res(m, vector<int>(n, 0)); 5 for (int i = 0; i < m; ++i) { 6 for (int j = 0; j < n; ++j) { 7 res[i][j] = min(row[i], col[j]); 8 row[i] -= res[i][j], col[j] -= res[i][j]; 9 } 10 } 11 return res; 12 } 13 };