DP问题：leecode(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.

主要是二维向量忘了怎么用。。。注意获取二维向量row和col的方式。设的追踪解的数组与给定的二维向量下标不一致，注意一下下～

C++代码：

#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) {
        if(obstacleGrid.empty())
            return 0;
        int m=obstacleGrid.size();
        int n=obstacleGrid[0].size();
        int a[101][101];
        a[1][1]=1-obstacleGrid[0][0];
        for(int i=2;i<=n;i++) {
            if(a[1][i-1]==0||obstacleGrid[0][i-1]==1) a[1][i]=0;
            else a[1][i]=1;
            }
        for(int i=2;i<=m;i++) {
            if(a[i-1][1]==0||obstacleGrid[i-1][0]==1) a[i][1]=0;
            else a[i][1]=1;
         }
        for(int i=2;i<=m;i++)
            for(int j=2;j<=n;j++){
                if(obstacleGrid[i-1][j-1]==1) a[i][j]=0;
                else a[i][j]=a[i][j-1]+a[i-1][j];
            }
        return a[m][n];

    }
};



int main()
{
    int arr[] = {-2,1,-3,4,-1,2,1,-5,4};
    int m=3,n=3;
    vector<vector<int> >obstacleGrid;
    vector<int>line;
    for(int i=0;i<m;i++){
        obstacleGrid.push_back(line);
        for(int j=0;j<n;j++){
            obstacleGrid[i].push_back(0);
        }
    }
    obstacleGrid[1][1]=1;
    cout<<(new Solution())->uniquePathsWithObstacles(obstacleGrid);
}