diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_falling_path_sum.rs | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_falling_path_sum.rs')
-rw-r--r-- | other/min_falling_path_sum.rs | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/other/min_falling_path_sum.rs b/other/min_falling_path_sum.rs deleted file mode 100644 index 4b704c1..0000000 --- a/other/min_falling_path_sum.rs +++ /dev/null @@ -1,23 +0,0 @@ -struct Solution; - -impl Solution { - pub fn min_falling_path_sum(matrix: Vec<Vec<i32>>) -> i32 { - matrix.into_iter().reduce(|prev, mut curr| { - prev.into_iter().chain(std::iter::once(i32::MAX)).scan((i32::MAX, i32::MAX, i32::MAX), |(w1, w2, w3), c| { - *w1 = *w2; - *w2 = *w3; - *w3 = c; - Some(c.min(*w1).min(*w2)) - }).skip(1).zip(curr.iter_mut()).for_each(|(p, c)| *c += p); - curr - }).unwrap().into_iter().min().unwrap() - } -} - -fn main() { - let matrix = vec![ - vec![2,1,3], - vec![6,5,4], - vec![7,8,9]]; - print!("{}", Solution::min_falling_path_sum(matrix)); -} |