|
| 1 | +pub struct Solution {} |
| 2 | + |
| 3 | +impl Solution { |
| 4 | + pub fn unique_paths(m: i32, n: i32) -> i32 { |
| 5 | + let mut mem: Vec<Vec<i32>> = vec![vec![0; n as usize]; m as usize]; |
| 6 | + mem[m as usize - 1][n as usize - 1] = 1; |
| 7 | + for i in (0..m).rev() { |
| 8 | + for k in (0..n).rev() { |
| 9 | + if k == n - 1 && i == m - 1 { |
| 10 | + continue; |
| 11 | + } |
| 12 | + let (d1, d2) = { |
| 13 | + let (mut d1, mut d2) = (0, 0); |
| 14 | + if i + 1 < m { |
| 15 | + d1 = mem[i as usize + 1][k as usize]; |
| 16 | + } |
| 17 | + if k + 1 < n { |
| 18 | + d2 = mem[i as usize][k as usize + 1]; |
| 19 | + } |
| 20 | + (d1, d2) |
| 21 | + }; |
| 22 | + mem[i as usize][k as usize] = d1 + d2; |
| 23 | + } |
| 24 | + } |
| 25 | + mem[0][0] |
| 26 | + } |
| 27 | +} |
0 commit comments