Dynamic Programming——No.63 Unique Paths II

Problem：

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?

Explanation：

在一个m*n的格子中，机器人在左上方，终点在右下方，机器人每次只能向下或向右走一步，现在考虑有障碍物，有几种走法到终点。

My Thinking：

利用一维数组dp[i]来存储到i的路径数，按行遍历，如果碰到障碍物1，则数量设为0，不然就满足dp[i]=dp[i-1]+dp[i]

My Solution：

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m=obstacleGrid.length;//行数
        int n=obstacleGrid[0].length;//列数
        int[] bp=new int[n];
        //设置第一行的值
        for(int i=0;i<n;i++){
            if(obstacleGrid[0][i]==1){
                break;
            }else{
                bp[i]=1;
            }
        }
       for(int i=1;i<m;i++){
           for(int j=0;j<n;j++){         
               if(obstacleGrid[i][j]==1){
                   bp[j]=0;
                   continue;
               }     
               int up=bp[j];//上一行的路径数
               int left=j==0?0:bp[j-1];//左边的路径数           
               bp[j]=up+left;         
           }
       }
        return bp[n-1];
    }
}

Optimum Thinking:

Optimum Solution：