79. Word Search

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

For example,
Given board = 

[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

word  =  "ABCCED" , -> returns  true ,
word  =  "SEE" , -> returns  true ,
word  =  "ABCB" , -> returns  false .

对于每一个字符进行发散查找，能对应上string的对应位就继续发散，不过因为没个字符只能用一次，要有一个矩阵存放当前字符已经被用过。代码如下：

public class Solution {
    private boolean[][] visited;
    
    public boolean exist(char[][] board, String word) {
        char[] chs = word.toCharArray();
        visited = new boolean[board.length][board[0].length];
        for (int i = 0; i < board.length; i ++) {
            for (int j = 0; j < board[i].length; j ++) {
                if (chs[0] == board[i][j] && search(board, i, j, chs, 0)) {
                    return true;
                }
            }
        }
        return false;
    }
    
    private boolean search(char[][] board, int i, int j, char[] word, int index) {
        if (index == word.length) {
            return true;
        }
        if (i >= board.length || i < 0 || j >= board[0].length || j < 0 || visited[i][j] || word[index] != board[i][j]) {
            return false;
        }
        visited[i][j] = true;
        boolean result = search(board, i + 1, j, word, index + 1) || search(board, i - 1, j, word, index + 1) || search(board, i, j + 1, word, index + 1) || search(board, i, j - 1, word, index + 1);
        visited[i][j] = false;
        return result;
    }
}