【LeetCode】【JAVA】【063】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.

思路：

使用recursion，超时了。还是应该使用DP来写，之前DP的 Unique Paths I：

http://blog.csdn.net/kuerii/article/details/43465567

Code：

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

备注：

用DP！