leetcode_solutions/
n1605_find_valid_matrix_given_row_and_column_sums.rs1use crate::Solution;
7
8impl Solution {
9 pub fn restore_matrix(mut row_sum: Vec<i32>, mut col_sum: Vec<i32>) -> Vec<Vec<i32>> {
10 let mut res = vec![vec![0; col_sum.len()]; row_sum.len()];
11
12 for row_idx in 0..row_sum.len() {
13 for col_idx in 0..col_sum.len() {
14 res[row_idx][col_idx] = std::cmp::min(row_sum[row_idx], col_sum[col_idx]);
15 row_sum[row_idx] -= res[row_idx][col_idx];
16 col_sum[col_idx] -= res[row_idx][col_idx];
17 }
18 }
19
20 res
21 }
22}