1
class Solution {
2
  public int uniquePathsWithObstacles(int[][] OG) {
3
    if (OG[0][0] == 1) return 0;
4
    int m = OG.length, n = OG[0].length;
5
    int[][] dp = new int[m][n];
6
    dp[0][0] = 1;
7
    for (int i = 0; i < m; i++)
8
      for (int j = 0; j < n; j++)
9
        if (OG[i][j] == 1 || (i == 0 && j == 0)) continue;
10
        else dp[i][j] = (i > 0 ? dp[i - 1][j] : 0) + (j > 0 ? dp[i][j - 1] : 0);
11
    return dp[m - 1][n - 1];
12
  }
13
}