largest_magic_square.rs

impl Solution {
    pub fn largest_magic_square(mut grid: Vec<Vec<i32>>) -> i32 {
        let mut isum = grid.clone();
        let mut jsum = grid.clone();
        for i in 0..grid.len() {
            for j in 0..grid[i].len() {
                if i > 0 {
                    isum[i][j] = grid[i][j] + grid[i - 1][j];
                }
            }
        }
        for i in 0..grid.len() {
            for j in 0..grid[i].len() {
                if j > 0 {
                    jsum[i][j] = grid[i][j] + grid[i][j - 1];
                }
            }
        }
        for i  in 0..grid.len() {
            for j in 0..grid[i].len(){
                print!("{}\t", isum[i][j]);
            }
            println!();
        }
        println!();
        for i  in 0..grid.len() {
            for j in 0..grid[i].len(){
                print!("{}\t", jsum[i][j]);
            }
            println!();
        }
        println!();
        0
    }
}

struct Solution;
fn main() {
    let vals = vec![
        vec![7, 1, 4, 5, 6],
        vec![2, 5, 1, 6, 4],
        vec![1, 5, 4, 3, 2],
        vec![1, 2, 7, 3, 4],
    ];
    println!("{}", Solution::largest_magic_square(vals));
}