【LeetCode】63. Unique Paths II

题目：
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).

Now consider if some obstacles are added to the grids. How many unique paths would there be?

思路：
这道题首先没有mn需要自己写
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
和上一道题思路一样，第一遍遍历的时候如果遇到1就break说明后面都到不了。
第二次循环的时候，如果遇到了1，就直接跳过本次循环，不计。最后returnm-1n-1就行了

Code：

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
   int m = obstacleGrid.length;
    int n = obstacleGrid[0].length;
    int[][] dp = new int[m][n];
    for(int i=0;i<m;i++){
        if (obstacleGrid[i][0]==1)break;
        dp[i][0] = 1;
    }
    
    for(int j=0;j<n;j++){
        if(obstacleGrid[0][j]==1)break;
        dp[0][j] = 1;
    }
    
    for(int i=1;i<m;i++){
        for(int j=1;j<n;j++){
            if(obstacleGrid[i][j]==1) continue;
            dp[i][j]=dp[i-1][j]+dp[i][j-1];
        }
    }
    return dp[m-1][n-1];
}