Commit fc28660

committed

添加(0062.不同路径.md):增加typescript版本

1 parent f409384 commit fc28660Copy full SHA for fc28660

File tree

+29

-1

lines changed

+29

-1

lines changed

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -273,7 +273,7 @@ public:`
`273`	`273`	`return dp[m-1][n-1];`
`274`	`274`	`}`
`275`	`275`
`276`		-```
	`276`	+```
`277`	`277`
`278`	`278`	`### Python`
`279`	`279`	```python
`@@ -347,7 +347,35 @@ var uniquePaths = function(m, n) {`
`347`	`347`	`};`
`348`	`348`	```
`349`	`349`
	`350`	`+### TypeScript`
	`351`	`+`
	`352`	+```typescript
	`353`	`+function uniquePaths(m: number, n: number): number {`
	`354`	`+ /**`
	`355`	`+ dp[i][j]: 到达(i, j)的路径数`
	`356`	`+ dp[0][*]: 1;`
	`357`	`+ dp[*][0]: 1;`
	`358`	`+ ...`
	`359`	`+ dp[i][j]: dp[i - 1][j] + dp[i][j - 1];`
	`360`	`+ */`
	`361`	`+ const dp: number[][] = new Array(m).fill(0).map(_ => []);`
	`362`	`+ for (let i = 0; i < m; i++) {`
	`363`	`+ dp[i][0] = 1;`
	`364`	`+ }`
	`365`	`+ for (let i = 0; i < n; i++) {`
	`366`	`+ dp[0][i] = 1;`
	`367`	`+ }`
	`368`	`+ for (let i = 1; i < m; i++) {`
	`369`	`+ for (let j = 1; j < n; j++) {`
	`370`	`+ dp[i][j] = dp[i - 1][j] + dp[i][j - 1];`
	`371`	`+ }`
	`372`	`+ }`
	`373`	`+ return dp[m - 1][n - 1];`
	`374`	`+};`
	`375`	+```
	`376`	`+`
`350`	`377`	`### C`
	`378`	`+`
`351`	`379`	```c
`352`	`380`	`//初始化dp数组`
`353`	`381`	`int **initDP(int m, int n) {`

Comments

(0)