Programmers 등굣길

Answer

public class Solution {

    public int solution(int m, int n, int[][] puddles) {
    int[][] street = new int[n][m];

    for (int[] puddle : puddles)
        street[puddle[1] - 1][puddle[0] - 1] = -1;

    street[0][0] = 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {

            if(street[i][j] == -1) {
                street[i][j] = 0;
                continue;
            }

            if(i != 0)
                street[i][j] += street[i - 1][j] % 1000000007;

            if(j != 0)
                street[i][j] += street[i][j - 1] % 1000000007;
        }
    }

    return street[n - 1][m - 1] % 1000000007;
    }
    
}