mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 13:00:22 +08:00
添加 0062.不同路径.md Rust版本
添加 0062.不同路径.md Rust版本
This commit is contained in:
@ -374,6 +374,30 @@ function uniquePaths(m: number, n: number): number {
|
|||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### Rust
|
||||||
|
|
||||||
|
```Rust
|
||||||
|
impl Solution {
|
||||||
|
pub fn unique_paths(m: i32, n: i32) -> i32 {
|
||||||
|
let m = m as usize;
|
||||||
|
let n = n as usize;
|
||||||
|
let mut dp = vec![vec![0; n]; m];
|
||||||
|
for i in 0..m {
|
||||||
|
dp[i][0] = 1;
|
||||||
|
}
|
||||||
|
for j in 0..n {
|
||||||
|
dp[0][j] = 1;
|
||||||
|
}
|
||||||
|
for i in 1..m {
|
||||||
|
for j in 1..n {
|
||||||
|
dp[i][j] = dp[i-1][j] + dp[i][j-1];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
dp[m-1][n-1]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
### C
|
### C
|
||||||
|
|
||||||
```c
|
```c
|
||||||
|
Reference in New Issue
Block a user