LeetCode(63): Unique Paths2

题目

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 类似，不过需要将障碍物处的路径数目设置为0，可以直接使用动态规划

1 使用二维数组的动态规划，需要在两边处

class Solution{
public:
	int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid){
		if (obstacleGrid.empty())
			return 0;
		int m = obstacleGrid.size();
		int n = obstacleGrid[0].size();
		if (m < 1 || n < 1)
			return 0;
		vector<vector<int> > result(m,vector<int>(n,1));
		for (int i = 0 ; i < m; i++){
			if (obstacleGrid[i][0] == 1){
				for (int j = i; j < m; j++){
					result[j][0] = 0;
				}
				break;
			}
		}
		for (int i = 0 ; i < n; i++){
			if (obstacleGrid[0][i] == 1){
				for (int j = i; j < n; j++){
					result[0][j] = 0;
				}
				break;
			}
		}
		for (int i = 1 ; i < m ; i++){
			for (int j = 1 ; j < n; j++){
				result[i][j] = result[i-1][j] + result[i][j-1];
				if (obstacleGrid[i][j] == 1)
					result[i][j] = 0;
			}
		}

		return result[m-1][n-1];
	}
};

2 一维数组

int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid){
			if (obstacleGrid.empty())
				return 0;
			int m = obstacleGrid.size();
			int n = obstacleGrid[0].size();
			if (m < 1 || n < 1)
				return 0;
			vector<int> result(n);
			result[0] = 1;
			for (int i = 0 ; i < m ; i++){
				for (int j = 0 ; j < n ; j++){
					if (obstacleGrid[i][j] == 1)
						result[j] = 0;
					else{
						if (j > 0)
							result[j] += result[j-1];
					}
				}
			}
			return result[n-1];
		}