Commit dc1269e

committed

[03/18] 實際03/07, 63-uniquePathsWithObstacles

1 parent 71f332f commit dc1269eCopy full SHA for dc1269e

File tree

+60

-0

lines changed

+60

-0

lines changed

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+package algo`
	`2`	`+`
	`3`	`+`
	`4`	`+func uniquePathsWithObstacles(obstacleGrid [][]int) int {`
	`5`	`+ // init`
	`6`	`+ metrix := make([][]int, len(obstacleGrid))`
	`7`	`+ for i:=0;i<len(obstacleGrid);i++{`
	`8`	`+ row := make([]int, len(obstacleGrid[0]))`
	`9`	`+ row[0] = 1`
	`10`	`+ metrix[i] = row`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ for i:=0;i<len(obstacleGrid[0]);i++{`
	`14`	`+ metrix[0][i] = 1`
	`15`	`+ }`
	`16`	`+ if obstacleGrid[0][0] == 1{`
	`17`	`+ metrix[0][0] = 0`
	`18`	`+ } else{`
	`19`	`+ metrix[0][0] = 1`
	`20`	`+ }`
	`21`	`+ // 判斷`
	`22`	`+ for i:=1;i<len(obstacleGrid);i++{`
	`23`	`+ if obstacleGrid[i][0] == 1 {`
	`24`	`+ metrix[i][0] = 0`
	`25`	`+ }else{`
	`26`	`+ metrix[i][0] = metrix[i-1][0]`
	`27`	`+ }`
	`28`	`+ }`
	`29`	`+ for j:=1;j<len(obstacleGrid[0]);j++{`
	`30`	`+ if obstacleGrid[0][j] == 1 {`
	`31`	`+ metrix[0][j] = 0`
	`32`	`+ } else{`
	`33`	`+ metrix[0][j] = metrix[0][j-1]`
	`34`	`+ }`
	`35`	`+ }`
	`36`	`+ for i:=1;i<len(obstacleGrid);i++{`
	`37`	`+ for j:=1;j<len(obstacleGrid[0]);j++{`
	`38`	`+ if obstacleGrid[i][j] == 1 {`
	`39`	`+ metrix[i][j] = 0`
	`40`	`+ } else{`
	`41`	`+ metrix[i][j] = metrix[i-1][j] + metrix[i][j-1]`
	`42`	`+ }`
	`43`	`+ }`
	`44`	`+ }`
	`45`	`+ return metrix[len(obstacleGrid)-1][len(obstacleGrid[0])-1]`
	`46`	`+}`

Lines changed: 11 additions & 0 deletions

Lines changed: 3 additions & 0 deletions

Comments

(0)