Method min_falling_path_sum

931. Maximum Frequency Stack/src/lib.rs:4–12

(mut matrix: Vec<Vec<i32>>)

impl Solution {
    pub fn min_falling_path_sum(mut matrix: Vec<Vec<i32>>) -> i32 {
        let n = matrix.len();
        for i in 1..n { for j in 0..n {
            if j == 0 { matrix[i][j] += matrix[i-1][j].min(matrix[i-1][j+1]) }
            else if j == n - 1 { matrix[i][j] += matrix[i-1][j].min(matrix[i-1][j-1]) }
            else { matrix[i][j] += matrix[i-1][j].min(matrix[i-1][j+1]).min(matrix[i-1][j-1]) }
        }}
        *matrix[n-1].iter().min().unwrap()
    }
}

#[cfg(test)]