[Leetcode] #62#63 Unique Paths I & II

Discription:

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).

How many possible unique paths are there?

Above is a 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Solution:

int uniquePaths(int m, int n) {
	if (m < 1 || n < 1) return 0;
	vector<int> nums(n, 1);
	for (int i = 1; i < m; i++){
		for (int j = 1; j < n; j++){
			nums[j] = nums[j - 1] + nums[j];
		}		
	}
	return nums[n - 1];
}

Discription:

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.

Solution:

//我的比较挫的写法
int uniquePathsWithObstacles(vector<vector<int>>& grid) {
	int m = grid.size();
	int n = grid[0].size();
	vector<int> nums(n, 1);
	for (int i = 0; i < n; i++){
		if (grid[0][i] == 1){
			for (int j = i; j < n; j++){
				nums[j] = 0;
			}
			break;
		}
	}
	for (int i = 1; i < m; i++){
		if (nums[0] == 1){
			if (grid[i][0] == 1)
				nums[0] = 0;
		}	
		for (int j = 1; j < n; j++){
			if (grid[i][j] == 1)
				nums[j] = 0;
			else
				nums[j] = nums[j - 1] + nums[j];
		}
	}
	return nums[n - 1];
}

int uniquePathsWithObstacles(vector<vector<int>>& grid){
	int width = grid[0].size();
	vector<int> dp(width);
	dp[0] = 1;
	for (vector<int> row : grid) {
		for (int j = 0; j < width; j++) {
			if (row[j] == 1)
				dp[j] = 0;
			else if (j > 0)
				dp[j] += dp[j - 1];
		}
	}
	return dp[width - 1];
}

GitHub-Leetcode:GitHub - wenwu313/LeetCode: Solutions of LeetCode Online Judge

参考：Loading...