剑指offer12 矩阵中的路径

问题描述

设计一个函数，用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一格开始，每一步可以在矩阵中向左、右、上、下移动一格。如果一条路径经过了矩阵的某一格，那么该路径不能再次进入该格子。
输入是一个矩阵和一个字符串，判断这个矩阵是否存在一条路径，和这个字符串顺序一样。存在返回true，不存在返回false。

代码

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        char[][] board = new char[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                board[i][j] = scanner.next().charAt(0);
            }
        }
        scanner.nextLine();
        String word = scanner.nextLine();
        System.out.println(exist(board, word));
    }

    public static boolean exist(char[][] board, String word) {
        char[] words = word.toCharArray();
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                if (dfs(board, words, i, j, 0)) return true;
            }
        }
        return false;
    }

    public static boolean dfs(char[][] board, char[] words, int i, int j, int k) {
        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != words[k])
            return false;
        if (k == words.length - 1) return true;
        char temp = board[i][j];
        board[i][j] = '*';
        boolean res = dfs(board, words, i, j + 1, k + 1) || dfs(board, words, i - 1, j, k + 1) ||
                      dfs(board, words, i, j - 1, k + 1) || dfs(board, words, i + 1, j, k + 1);
        board[i][j] = temp;
        return res;
    }


}