Unique Paths II

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] mytable = new int[m][n];
        
        for(int i = 0; i < m; i++)
            for(int j = 0; j < n; j++){
                if(obstacleGrid[i][j] == 1)
                    continue;
                else if(i - 1 < 0 && j - 1 < 0)
                    mytable[0][0] = 1;
                else if(i - 1 < 0)
                    mytable[i][j] = mytable[i][j - 1];
                else if(j - 1 < 0)
                    mytable[i][j] = mytable[i - 1][j];
                else
                    mytable[i][j] = mytable[i][j - 1] + mytable[i - 1][j];
            }
        return mytable[m-1][n-1];
    }
}