2

Author: kedebug

UniquePathsII/UniquePathsII.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
+        // Start typing your C/C++ solution below
+        // DO NOT write int main() function
+        
+        int m = obstacleGrid.size();
+        if (m == 0) return 0;
+        int n = obstacleGrid[0].size();
+        
+        vector<vector<int>> dp(m, vector<int>(n, 0));
+        
+        for (int i = 0; i < m; i++) {
+            if (obstacleGrid[i][0] == 0) 
+                dp[i][0] = 1;
+            else
+                break;
+        }
+        for (int j = 0; j < n; j++) {
+            if (obstacleGrid[0][j] == 0) 
+                dp[0][j] = 1;
+            else
+                break;
+        }
+        for (int i = 1; i < m; i++) {
+            for (int j = 1; j < n; j++) {
+                if (obstacleGrid[i][j] == 0)
+                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
+            }
+        }
+        return dp[m-1][n-1];
+        
+    }
+};