mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-12 21:50:49 +08:00
Merge pull request #810 from Jerry-306/patch-27
新增 0062 不同路径 JavaScript版本 另一种写法
This commit is contained in:
@ -327,6 +327,25 @@ var uniquePaths = function(m, n) {
|
|||||||
return dp[m - 1][n - 1]
|
return dp[m - 1][n - 1]
|
||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
>版本二:直接将dp数值值初始化为1
|
||||||
|
```javascript
|
||||||
|
/**
|
||||||
|
* @param {number} m
|
||||||
|
* @param {number} n
|
||||||
|
* @return {number}
|
||||||
|
*/
|
||||||
|
var uniquePaths = function(m, n) {
|
||||||
|
let dp = new Array(m).fill(1).map(() => new Array(n).fill(1));
|
||||||
|
// dp[i][j] 表示到达(i,j) 点的路径数
|
||||||
|
for (let i=1; i<m; i++) {
|
||||||
|
for (let j=1; j< n;j++) {
|
||||||
|
dp[i][j]=dp[i-1][j]+dp[i][j-1];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return dp[m-1][n-1];
|
||||||
|
|
||||||
|
};
|
||||||
|
```
|
||||||
|
|
||||||
|
|
||||||
-----------------------
|
-----------------------
|
||||||
|
Reference in New Issue
Block a user