[LeetCode] 63. Unique Paths II

思路:
我没有开辟额外数组, 所以额外的空间复杂度是O(1). 先更新第一排和第一列, 遇到1就置0, 否则就是1. 然后遍历其他格子, 如果是1就置0, 如果不是的话结果就是其左边和上边格子的和.

int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
    int m = obstacleGrid.size(), n = obstacleGrid[0].size();
    if (obstacleGrid[0][0] || ! m || ! n) return 0;

    obstacleGrid[0][0] = 1;
    for (int i = 1; i < m; i++)
        obstacleGrid[i][0] = obstacleGrid[i][0] ? 0 : obstacleGrid[i - 1][0];

    for (int j = 1; j < n; j++)
        obstacleGrid[0][j] = obstacleGrid[0][j] ? 0 : obstacleGrid[0][j - 1];

    for (int i = 1; i < m; i++) 
        for (int j = 1; j < n; j++)
            obstacleGrid[i][j] = obstacleGrid[i][j] ? 0 : obstacleGrid[i][j - 1] + obstacleGrid[i - 1][j];  

    return obstacleGrid[m - 1][n - 1];
}