LeetCode-Unique Paths II

LeetCode-Unique Paths II

Follow up for "Unique Paths ":

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

An obstacle and empty space is marked1And0Respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as partitioned strated below.

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

The total number of unique paths is2.

Note: m and n will be at most 100.

Solution Report: Unique Paths II is an upgraded version of Unique Paths. One more array is saved as 1, which means the obstacle cannot be solved. Therefore, we need to make another judgment when solving the problem. Not hard

class Solution {public:   int uniquePathsWithObstacles(vector
 
   > &obstacleGrid) {        size_t m = obstacleGrid.size();        size_t n = obstacleGrid[0].size();        int temp[m][n];        for (size_t i = 0; i != m; i++)            for(size_t j = 0; j != n; j++)            temp[i][j] = 0;        temp[0][0] = 1;        for (size_t i = 0; i != m; i++) {            for(size_t j = 0; j != n; j++) {                if(obstacleGrid[i][j] != 1)  {                if(j != n-1) {                   if(temp[i][j+1] != -1)                     temp[i][j+1] += temp[i][j];                   else                     temp[i][j+1] = temp[i][j];                }}                else                    temp[i][j] = 0;              if(obstacleGrid[i][j] != 1) {                  if(i != m-1) {                   if(temp[i+1][j] != -1)                    temp[i+1][j] += temp[i][j];                   else                    temp[i+1][j] = temp[i][j] ;                }}                else                    temp[i][j] = 0 ;            }         }         return temp[m-1][n-1];    }};