lc-1301

张小猪粉鼻子

于 2024-08-07 03:59:20 发布

阅读量17

点赞数

public int[] pathsWithMaxScore(List<String> board) {
    int m = board.size();
    int n = board.get(0).length();
    int mod = 1_000_000_007;
    int[][] grid = new int[m][n];
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            char c = board.get(i).charAt(j);
            if (c == 'X') {
                grid[i][j] = -1;
            }else{
                grid[i][j] = c - '0';
            }
        }
    }
    grid[0][0] = 0;
    grid[m -1][n -1] =  0;

    int[][] score = new int[m][n];
    int[][] paths = new int[m][n];
    for (int i = n -2; i >= 0; i--) {
        if (grid[m - 1][i + 1] == -1) {
            grid[m - 1][i] = -1;
            paths[m -1][i] = 0;
        }
        if (grid[m - 1][i] == -1) {
            continue;
        }
        score[m - 1][i] = score[m - 1][i + 1] + grid[m - 1][i];
        paths[m -1][i] = 1;
    }

    for (int i = m - 2; i >= 0; i--) {
        if (grid[i + 1][n -1] == -1) {
            grid[i][n -1] = -1;
            paths[i][n -1] = 0;
        }
        if (grid[i][n -1] == -1) {
            continue;
        }
        score[i][n -1] = score[i + 1][n -1] + grid[i][n -1];
        paths[i][n - 1] = 1;
    }

    for (int j = n -2; j >= 0; j--) {
        for (int i = m -2; i >= 0; i--) {
            if (grid[i][j + 1] + grid[i + 1][j] + grid[i + 1][j + 1] == -3) {
                grid[i][j] = -1;
            }

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

            if (grid[i][j + 1] != -1) {
                int sc = score[i ][j + 1] + grid[i][j];
                if (sc > score[i][j]) {
                    score[i][j] = sc;
                    paths[i][j] = 0;
                }
                if (sc == score[i][j]) {
                    paths[i][j] = (paths[i][j] + paths[i][j + 1])%mod;
                }
            }
            if (grid[i + 1][j] != -1) {
                int sc = score[i + 1][j] + grid[i][j];
                if (sc > score[i][j]) {
                    score[i][j] = sc;
                    paths[i][j] = 0;
                }
                if (sc == score[i][j]) {
                    paths[i][j] = (paths[i][j] + paths[i + 1][j])%mod;
                }
            }
            if (grid[i + 1][j + 1] != -1) {
                int sc = score[i + 1][j + 1] + grid[i][j];
                if (sc > score[i][j]) {
                    score[i][j] = sc;
                    paths[i][j] = 0;
                }
                if (sc == score[i][j]) {
                    paths[i][j] = (paths[i][j] + paths[i + 1][j + 1])%mod;
                }
            }



        }
    }

    return new int[]{score[0][0], paths[0][0]};
}