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.

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        if(obstacleGrid[0][0] || obstacleGrid[m-1][n-1] ) return 0;
        vector<vector<int>> v(m,vector<int>(n,1)); //初始化为1，每走一步加上当前的值，多一条路
        int token = 1;

       //首先初始化第一列和第一行的值
        for(int i = 0;i<m;i++){            //第一列如果无障碍，则为1，否则为0
            if(obstacleGrid[i][0] == 1){
                token = 0;
            }
            v[i][0] = token;
        }
        token = 1;
        for(int i =0;i<n;i++){      //第一行如果无障碍，则为1，否则为0
            if(obstacleGrid[0][i] == 1){
                token = 0;
            }
            v[0][i] = token;
        }
        for(int i =1;i<m;i++){ //从第二行第二列出发，从第一行或者第一列到达都只有一条路
            for(int j =1;j<n;j++){
                if(obstacleGrid[i][j] == 1){
                    v[i][j] = 0;
                }else{
                    int tmp = obstacleGrid[i-1][j] == 1? 0 : v[i-1][j];
                    int tmp2 = obstacleGrid[i][j-1] == 1? 0 : v[i][j-1];
                    v[i][j] = tmp+tmp1;
                }
            }
        }
        return v[m-1][n-1];
    }
};