algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0062.不同路径.md

Browse Source
This commit is contained in:
fw_qaq
2023-04-13 17:01:45 +08:00
committed by GitHub
parent 3b8eff71cd
commit f7680ab01d
1 changed files with 7 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/0062.不同路径.md
View File

@ -395,15 +395,8 @@ function uniquePaths(m: number, n: number): number {
```Rust ```Rust
impl Solution { impl Solution {
pub fn unique_paths(m: i32, n: i32) -> i32 { pub fn unique_paths(m: i32, n: i32) -> i32 {
let m = m as usize; let (m, n) = (m as usize, n as usize);
let n = n as usize; let mut dp = vec![vec![1; n]; m];
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 i in 1..m {
for j in 1..n { for j in 1..n {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; dp[i][j] = dp[i - 1][j] + dp[i][j - 1];