[LeetCode]--63. Unique Paths II

Let’s see the 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.

I will share some an innovative thought
I will give the representation below!

$$f(m,n) = \begin{cases} f(m-1,n) + f(m,n-1) &,\text{if A[m,n] $\neq1$}\\ 0 &,\text{if A[m,n] = 1} \end{cases}$$
Be sure that f[1,1] = 1

So, make a little improvement by use 1 dimension array instead of 2D array!
Let’s see the code!

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int width = obstacleGrid[0].length;
        int[] dp = new int[width];
        dp[0] = 1;
        for (int[] row : obstacleGrid) {
            for (int j = 0; j < width; j++) {
                if (row[j] == 1) dp[j] = 0;
                else if (j > 0) 
                    dp[j] += dp[j - 1];
            }
        }
        return dp[width - 1];
    }
}

Just excellent idea to use
dp[j] += dp[j - 1];which means
dp[j](now) = dp[j-1](now) + dp[j](past)
dp[j](now) means the f[m,n]
dp[j-1](now) represents the f[m,n-1]
while dp[j](past) is the value of f[m-1,n]

Well, Brilliant Idea!

References:
[1] https://discuss.leetcode.com/topic/10974/short-java-solution/2