unique paths ii java_leetcode java Unique Paths II

public class Solution {

public int uniquePathsWithObstacles(int[][] obstacleGrid) {

int m = 0;int n = 0;

m = obstacleGrid.length;

n = obstacleGrid[0].length;

if(obstacleGrid == null)

return -1;

int[][] f = new int[m][n];

if(obstacleGrid[0][0] == 1)

f[0][0] = 0;

else

f[0][0] = 1;//this step is help to avoid the indext out of the bound

for(int i = 1;i< m;i++)

{

if(obstacleGrid[i][0] == 1||f[i-1][0] == 0)

f[i][0] = 0;

else

f[i][0] = 1;

}

for(int j = 1;j< n;j++)

{

if(obstacleGrid[0][j] == 1 || f[0][j-1] == 0)

f[0][j] = 0;

else

f[0][j] = 1;

}

for(int i = 1;i< m;i++)

for(int j = 1;j< n;j++)

{

if(obstacleGrid[i][j] == 1)

f[i][j] = 0;

else

f[i][j] = f[i-1][j]+f[i][j-1];

}

return f[m-1][n-1];

}

}

//this problem is just like last one. However, you should take care of the condition that you should consider 

//of the obstacle and because of obstacle, it cause some outbound problem