Unique Paths II Java

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.

Idea:

  Same idea as Unique Path, only thing different is we need to
    watch out if there is obstacle that mean we can not reach the
    destination through this path, thus we do not need to count this
    path into total.
    Approach detail:
    just set res[j]=0 if there is obstacle 

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
         int rows=obstacleGrid.length;
        int cols=obstacleGrid[0].length;
        //check for special case
        if(obstacleGrid==null || rows==0 || cols==0) return 1;
        int[] res=new int[cols];
        //initial step
        res[0]=1;
        for(int i=0;i<rows;i++){
            for(int j=0;j<cols;j++){
                if(obstacleGrid[i][j]==1){
                    res[j]=0;
                }else{
                    if(j>0)
                    res[j]+=res[j-1];
                }
            }
        }
        return res[cols-1];
    }
}