add 0063

Author: zangbianxuegu

0062. Unique Paths.js

@@ -76,4 +76,4 @@ const uniquePaths = (m, n) => {
   return arr[n - 1]
 }
 // Runtime: 48 ms, faster than 94.76 % of JavaScript online submissions for Unique Paths.
-// Memory Usage: 33.6 MB, less than 100.00 % of JavaScript online submissions for Unique Paths.
+// Memory Usage: 33.6 MB, less than 100.00 % of JavaScript online submissions for Unique Paths.

0063. Unique Paths II.js

@@ -24,3 +24,41 @@
 // 2. Down -> Down -> Right -> Right
 
 
+/**
+ * @param {number[][]} obstacleGrid
+ * @return {number}
+ */
+const uniquePathsWithObstacles = (obstacleGrid) => {
+  let row = obstacleGrid.length
+  let col = obstacleGrid[0].length
+  let arr = Array(row)
+  for (let i = 0; i < row; i++) {
+    arr[i] = Array(col).fill(1)
+  }
+  for (let i = 0; i < row; i++) {
+    for (let j = 0; j < col; j++) {
+      if (i === 0 && obstacleGrid[i][j] === 1) {
+        for (let k = 0; k < col; k++) {
+          if (k >= j) {
+            arr[0][k] = 0
+          }
+        }
+      }
+      if (j === 0 && obstacleGrid[i][j] === 1) {
+        for (let k = 0; k < row; k++) {
+          if (k >= i) {
+            arr[k][0] = 0
+          }
+        }
+      }
+      if (obstacleGrid[i][j] === 1) {
+        arr[i][j] = 0
+      } else if (i > 0 && j > 0) {
+        arr[i][j] = arr[i - 1][j] + arr[i][j - 1]
+      }
+    }
+  }
+  return arr[row - 1][col - 1]
+}
+// Runtime: 64 ms, faster than 43.05 % of JavaScript online submissions for Unique Paths II.
+// Memory Usage: 35.6 MB, less than 100.00 % of JavaScript online submissions for Unique Paths II.