From b323aec3fcf81211126e1be3e4112ac3ea4aca6f Mon Sep 17 00:00:00 2001 From: ChrisLin Date: Tue, 8 Jun 2021 23:39:17 +0800 Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00063.=E4=B8=8D=E5=90=8C?= =?UTF-8?q?=E8=B7=AF=E5=BE=84II=20Javascript=E7=89=88=E6=9C=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0063.不同路径II.md | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md index eeecad70..52f00322 100644 --- a/problems/0063.不同路径II.md +++ b/problems/0063.不同路径II.md @@ -279,6 +279,30 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int { ``` +Javascript +``` Javascript +var uniquePathsWithObstacles = function(obstacleGrid) { + const m = obstacleGrid.length + const n = obstacleGrid[0].length + const dp = Array(m).fill().map(item => Array(n).fill(0)) + + for (let i = 0; i < m && obstacleGrid[i][0] === 0; ++i) { + dp[i][0] = 1 + } + + for (let i = 0; i < n && obstacleGrid[0][i] === 0; ++i) { + dp[0][i] = 1 + } + + for (let i = 1; i < m; ++i) { + for (let j = 1; j < n; ++j) { + dp[i][j] = obstacleGrid[i][j] === 1 ? 0 : dp[i - 1][j] + dp[i][j - 1] + } + } + + return dp[m - 1][n - 1] +}; +``` -----------------------