LCR 129.字母迷宫

最新推荐文章于 2024-07-15 22:10:26 发布

_OLi_

最新推荐文章于 2024-07-15 22:10:26 发布

阅读量314

点赞数 7

分类专栏：力扣LCR 算法题合集文章标签：深度优先算法 leetcode java

本文链接：https://blog.csdn.net/qq_61504864/article/details/136361233

版权

力扣LCR 算法题合集专栏收录该内容

67 篇文章 0 订阅

订阅专栏

解题思路：

深度优先搜索（dfs）+ 剪枝

class Solution {
    public boolean wordPuzzle(char[][] grid, String target) {
        char[] words = target.toCharArray();
        for(int i = 0; i < grid.length; i++) {
            for(int j = 0; j < grid[0].length; j++) {
                if(dfs(grid, words, i, j, 0)) return true;
            }
        }
        return false;
    }
    boolean dfs(char[][] grid, char[] target, int i, int j, int k) {
        if(i >= grid.length || i < 0 || j >= grid[0].length || j < 0 || grid[i][j] != target[k]) return false;
        if(k == target.length - 1) return true;
        grid[i][j] = '\0';
        boolean res = dfs(grid, target, i + 1, j, k + 1) || dfs(grid, target, i - 1, j, k + 1) || 
                      dfs(grid, target, i, j + 1, k + 1) || dfs(grid, target, i , j - 1, k + 1);
        grid[i][j] = target[k];
        return res;
    }
}