[LeetCode] Unique Paths II 起点与终点确定的路径数II

声明：原题目转载自LeetCode，解答部分为原创

Problem ：

    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.

Solution：

    思路：动态规划，假定f（a， b）为从第a行第b列到目的地的路径数目，则状态转换方程为

     f（a， b） = f（a， b + 1） + f（a + 1， b）

    如图为m * n规格的图，开辟一个二维数组并初始化各位为0，且令f （m，n - 1） = 1.

    穷举所有的f（a，b），注意当原数组中第a行第b列的数值为1（代表障碍物）时，f（a，b）置位0，否则使用状态转换方程。

    代码如下：

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) {
    	int row = obstacleGrid.size();
    	int col = obstacleGrid[0].size();
        vector<vector<int> > num_of_way(row + 1, vector<int>(col + 1));
        num_of_way[row][col - 1] = 1;
        for(int i = row - 1 ; i >= 0 ; i --)
        {
        	for(int j = col - 1 ; j >= 0 ; j --)
        	{
        		if(obstacleGrid[i][j] == 1)
        			num_of_way[i][j] = 0;
        		else
        			num_of_way[i][j] = num_of_way[i][j + 1] + num_of_way[i + 1][j];
			}
		}
		return num_of_way[0][0];
    }
};

int main()
{
	Solution text;
	vector<vector<int> > temp(3, vector<int>(3));
	temp[1][1] = 1;
	cout << text.uniquePathsWithObstacles(temp) << endl;
	return 0;
}