leetcode 63 简单题

题目很水。。。

直接放代码了

int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridRowSize, int obstacleGridColSize) {
    int path[obstacleGridRowSize][obstacleGridColSize];
    if(obstacleGrid[][]==)
        path[][] = ;
    else
        path[][] = ;
    for(int i =;i<obstacleGridRowSize;i++)
        if(obstacleGrid[i][]==&&path[i-][]==)
            path[i][] = ;
        else
            path[i][] = ;
    for(int i =;i<obstacleGridColSize;i++)
        if(obstacleGrid[][i]==&&path[][i-]==)
            path[][i] = ;
        else
            path[][i] = ;
    for(int i =;i<obstacleGridRowSize;i++)
        for(int j =;j<obstacleGridColSize;j++)
        {
            if(obstacleGrid[i][j]==)
                path[i][j] = path[i-][j]+path[i][j-];
            else
                path[i][j] = ;
        }
    return path[obstacleGridRowSize-][obstacleGridColSize-];
}