Commit b29e9a6

committed

update: 63

1 parent ac537a9 commit b29e9a6Copy full SHA for b29e9a6

File tree

+27

-0

lines changed

+27

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -43,6 +43,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`43`	`43`	`\|56\|[Merge Intervals](https://leetcode.com/problems/merge-intervals/) \| [JavaScript](./src/merge-intervals/res.js)\|Medium\|`
`44`	`44`	`\|57\|[Insert Interval](https://leetcode.com/problems/insert-interval/) \| [JavaScript](./src/insert-interval/res.js)\|Hard\|`
`45`	`45`	`\|62\|[Unique Paths](https://leetcode.com/problems/unique-paths/) \| [JavaScript](./src/unique-paths/res.js)\|Medium\|`
	`46`	`+\|63\|[Unique Paths ii](https://leetcode.com/problems/unique-paths-ii/) \| [JavaScript](./src/unique-paths-ii/res.js)\|Medium\|`
`46`	`47`	`\|66\|[Plus One](https://leetcode.com/problems/plus-one/) \| [JavaScript](./src/plus-one/res.js)\|Easy\|`
`47`	`48`	`\|69\|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) \| [JavaScript](./src/sqrtx/res.js)\|Easy\|`
`48`	`49`	`\|71\|[Simplify Path](https://leetcode.com/problems/simplify-path/) \| [JavaScript](./src/simplify-path/res.js)\|Medium\|`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+/**`
	`2`	`+ * @param {number[][]} obstacleGrid`
	`3`	`+ * @return {number}`
	`4`	`+ */`
	`5`	`+var uniquePathsWithObstacles = function(obstacleGrid) {`
	`6`	`+ const n = obstacleGrid.length;`
	`7`	`+ if (!n) return 0;`
	`8`	`+ const m = obstacleGrid[0].length;`
	`9`	`+ if (!m) return 0;`
	`10`	`+`
	`11`	`+ for (let i = 0; i < n; i++) {`
	`12`	`+ for (let j = 0; j < m; j++) {`
	`13`	`+ if (i === 0 && j === 0) {`
	`14`	`+ obstacleGrid[i][j] = obstacleGrid[i][j] ? 0 : 1;`
	`15`	`+ } else if (i == 0) {`
	`16`	`+ obstacleGrid[i][j] = obstacleGrid[i][j] \|\| !obstacleGrid[i][j-1] ? 0 : 1;`
	`17`	`+ } else if (j == 0) {`
	`18`	`+ obstacleGrid[i][j] = obstacleGrid[i][j] \|\| !obstacleGrid[i-1][j] ? 0 : 1;`
	`19`	`+ } else {`
	`20`	`+ obstacleGrid[i][j] = obstacleGrid[i][j] ? 0 : obstacleGrid[i-1][j] + obstacleGrid[i][j-1];`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ return obstacleGrid[n-1][m-1];`
	`26`	`+};`

Comments

(0)