Commit d3e1f1d

committed

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

1 parent f409384 commit d3e1f1dCopy full SHA for d3e1f1d

File tree

+32

-1

lines changed

+32

-1

lines changed

Lines changed: 32 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -352,7 +352,38 @@ var uniquePathsWithObstacles = function(obstacleGrid) {`
`352`	`352`	`};`
`353`	`353`	```
`354`	`354`
`355`		`-C`
	`355`	`+### TypeScript`
	`356`	`+`
	`357`	+```typescript
	`358`	`+function uniquePathsWithObstacles(obstacleGrid: number[][]): number {`
	`359`	`+ /**`
	`360`	`+ dp[i][j]: 到达(i, j)的路径数`
	`361`	`+ dp[0][*]: 用u表示第一个障碍物下标,则u之前为1,u之后(含u)为0`
	`362`	`+ dp[*][0]: 同上`
	`363`	`+ ...`
	`364`	`+ dp[i][j]: obstacleGrid[i][j] === 1 ? 0 : dp[i-1][j] + dp[i][j-1];`
	`365`	`+ */`
	`366`	`+ const m: number = obstacleGrid.length;`
	`367`	`+ const n: number = obstacleGrid[0].length;`
	`368`	`+ const dp: number[][] = new Array(m).fill(0).map(_ => new Array(n).fill(0));`
	`369`	`+ for (let i = 0; i < m && obstacleGrid[i][0] === 0; i++) {`
	`370`	`+ dp[i][0] = 1;`
	`371`	`+ }`
	`372`	`+ for (let i = 0; i < n && obstacleGrid[0][i] === 0; i++) {`
	`373`	`+ dp[0][i] = 1;`
	`374`	`+ }`
	`375`	`+ for (let i = 1; i < m; i++) {`
	`376`	`+ for (let j = 1; j < n; j++) {`
	`377`	`+ if (obstacleGrid[i][j] === 1) continue;`
	`378`	`+ dp[i][j] = dp[i - 1][j] + dp[i][j - 1];`
	`379`	`+ }`
	`380`	`+ }`
	`381`	`+ return dp[m - 1][n - 1];`
	`382`	`+};`
	`383`	+```
	`384`	`+`
	`385`	`+### C`
	`386`	`+`
`356`	`387`	```c
`357`	`388`	`//初始化dp数组`
`358`	`389`	`int initDP(int m, int n, int obstacleGrid) {`

Comments

(0)