lc-2267

最新推荐文章于 2024-10-16 00:00:43 发布

守望之鹰

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量31

点赞数

文章标签：算法

 public boolean hasValidPath(char[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        if ((m + n) % 2 == 0) {
            return false;
        }
        if (grid[0][0] == ')') {
            return false;
        }
        if (grid[m - 1][n - 1] == '(') {
            return false;
        }
        int v = (m + n + 1)/2;
        boolean[][][] dp = new boolean[m + 1][n + 1][v];
        dp[0][1][0] = true;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < v; k++) {
                    if (dp[i+1][j][k] || dp[i][j + 1][k]) {
                        int step = grid[i][j] == '(' ? 1 : -1;
                        if (k + step >= 0 && k + step < v) {
                            dp[i + 1][j + 1][k + step] = true;
                        }
                    }
                }
            }
        }
        return dp[m][n][0];
    }