Unique Paths II

题目

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.

Note: m and n will be at most 100.

 

思路：动态规划

类似于  Unique Paths  ，加入判断条件即可。

注意：首先要判断  obstacleGrid[i][j]==1 

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();
        int n = obstacleGrid[0].size();
        vector<vector<int> > path(m, vector<int>(n,0) );  
        if(obstacleGrid[0][0]==0)
            path[0][0] = 1;
        else
            path[0][0] = 0;      
        for(int i=0;i<m;i++)  
        {  
            for(int j=0;j<n;j++)  
            { 
                if(obstacleGrid[i][j]==1)
                    path[i][j] = 0;
                else
                {
                    if(i==0 && j>0)  
                        path[i][j] = path[i][j-1];
                    if(i>0 && j==0)  
                        path[i][j] = path[i-1][j];
                    if(i>0 && j>0)
                        path[i][j] = path[i-1][j]+path[i][j-1];   
                }
            }  
        }  
        return path[m-1][n-1];  
    }
};

 

如果改成递归的形式：

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();
        int n = obstacleGrid[0].size();
        return myfun(obstacleGrid,m-1,n-1);
    }
    
    int myfun(vector<vector<int> > &obstacleGrid, int m, int n)
    {
        if(obstacleGrid[m][n]==1)
            return 0;
        else
        {
            if(m==0 && n==0)
                 return 1;
            if(m==0 && n>0)
                 return myfun(obstacleGrid,m,n-1);
            if(m>0 && n==0)
                 return myfun(obstacleGrid,m-1,n);
            if(m>0 && n>0)
                 return myfun(obstacleGrid,m-1,n)+myfun(obstacleGrid,m,n-1);                
        }
    }
};

小数据可以通过，但是大数据就会超时了。看来动态规划的确可以节约不少时间。

 

最新 java

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if(obstacleGrid==null||obstacleGrid.length==0)
            return 0;
     
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
     
        if(obstacleGrid[0][0]==1||obstacleGrid[m-1][n-1]==1) 
            return 0;
     
        int[][] dp = new int[m][n];
        dp[0][0]=1;
     
        //left column
        for(int i=1; i<m; i++){
            if(obstacleGrid[i][0]==1){
                dp[i][0] = 0;
            }else{
                dp[i][0] = dp[i-1][0];
            }
        }
     
        //top row
        for(int i=1; i<n; i++){
            if(obstacleGrid[0][i]==1){
                dp[0][i] = 0;
            }else{
                dp[0][i] = dp[0][i-1];
            }
        }
     
        //fill up cells inside
        for(int i=1; i<m; i++){
            for(int j=1; j<n; j++){
                if(obstacleGrid[i][j]==1){
                    dp[i][j]=0;
                }else{
                    dp[i][j]=dp[i-1][j]+dp[i][j-1];
                }
     
            }
        }
        return dp[m-1][n-1];
    }
}