Leetcode:63. Unique Paths II

Total Accepted: 65084 Total Submissions: 221586 Difficulty: Medium
time o(n*m) space o(n*m)
Ac 0ms

---

Follow up for “Unique Paths”:

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

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.
和上个问题差不多，不过多加了一个约束条件就是1 表示这个格子被堵死了。
加上约束 if(grid[i][j] == 1) dp[i][j] =0;
基本模型还是 dp[i][j] = dp[i-1][j] + dp[i][j-1]

int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridRowSize, int obstacleGridColSize) {
    int **grid =obstacleGrid;
    int m = obstacleGridRowSize;
    int n = obstacleGridColSize;
    int **dp=malloc(sizeof(int*)*m);
    for(int i=0;i<m;i++)
    {
        dp[i] = malloc(sizeof(int)*n);
        //        memset(dp[i],0,sizeof(int)*n);
    }
    int premin=0;
    for (int i=0;i<m;i++)
    {
        for (int j=0;j<n;j++)
        {
            if(grid[i][j]==1)
            {
                dp[i][j]=0;
                continue;
            }
            if(i==0&&j==0)
            {
                dp[0][0]=1;
                continue;
            }
            else if(i==0||j==0)
            {
                if(i==0)
                {
                    dp[i][j]=dp[i][j-1];
                }
                if(j==0)
                {
                    dp[i][j]=dp[i-1][j];
                }
            }
            else
            {   premin = dp[i-1][j]+dp[i][j-1];
                dp[i][j]=premin;
            }
        }
    }
    return dp[m-1][n-1];
}