【leetcode】【63】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.

二、问题分析

这道题与【leetcode】【62】Unique Paths不同之处在于，存在obstacle。还是先求第一行和第一列的状态，只不过需要注意obstacle，因为是第一行和第一列，所以obstacle后边的也不能到达 。其余没什么难点。

三、Java AC代码

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
		if (obstacleGrid==null || obstacleGrid.length==0 || obstacleGrid[0].length==0) {
			return 0;
		}
		int rows = obstacleGrid.length;
		int cols = obstacleGrid[0].length;
		int[][] dp = new int[rows][cols];
		for (int i = 0; i < cols; i++) {
			if (obstacleGrid[0][i]==1) {
				while(i<cols){
					dp[0][i] = 0;
					i++;
				}
				break;
			}else {
				dp[0][i] = 1;
			}
		}
		for (int i = 0; i < rows; i++) {
			if (obstacleGrid[i][0]==1) {
				while(i<rows){
					dp[i][0] = 0;
					i++;
				}
				break;
			}else {
				dp[i][0] = 1;
			}
		}
		for (int i = 1; i < rows; i++) {
			for (int j = 1; j < cols; j++) {
				if (obstacleGrid[i][j]==1) {
					dp[i][j] = 0;
				}else {
					dp[i][j] = dp[i-1][j] + dp[i][j-1]; 
				}
			}
		}
		return dp[rows-1][cols-1];
	}