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 =

[
  ["ABCE"],
  ["SFCS"],
  ["ADEE"]
]

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

Have you been asked this question in an interview?  
第一种 我的写法 注意不要在isValid()方法一开始就先判断 i是否已经是word 的最后一个了。因为如果 查询数组 是 ［a］， 而word 也是a 的话，则不能够继续recursive，同时 还会返回 false。
所以也就是要处理好 是在当前方法中判断是否已经word 的所以character 查询，还是要放到更深的一层里面判断。
另外一种更简便一点的方法也贴了，可以对比一下。

public class Solution {
    public boolean exist(char[][] board, String word) {
        if (word == null || board.length == 0 || board[0].length == 0) {
            return false;
        }
        boolean[][] visited  = new boolean[board.length][board[0].length];
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                if (isValid(board, word, 0, visited, i, j)) {
                    return true;
                }
            }
        }
        return false;
    }
    private boolean isValid (char[][] board, String word, int i, boolean[][] visited, int positionX, int positionY) {
        if (!visited[positionX][positionY] && board[positionX][positionY] == word.charAt(i)) {     
	            if (i == word.length() - 1) {
		            return true;
		        }
	            visited[positionX][positionY] = true;
	            boolean res = false;
            if (positionX - 1 >= 0) {
               res = isValid(board, word, i + 1, visited, positionX -1, positionY);
               if (res == true) {
                   return true;
               }
            }
            if (positionY - 1 >= 0) {
               res = isValid(board, word, i + 1, visited, positionX, positionY - 1);
               if (res == true) {
                   return true;
               }
            }
            if (positionX + 1 < board.length) {
               res = isValid(board, word, i + 1, visited, positionX + 1, positionY);
               if (res == true) {
                   return true;
               }
            }
            if (positionY + 1 < board[0].length) {
               res = isValid(board, word, i + 1, visited, positionX, positionY + 1);
               if (res == true) {
                   return true;
               }
            }
            visited[positionX][positionY] = false;
        } 
        return false;
    }
}

public class Solution {
    // recursion
    public boolean exist(char[][] board, String word) {
        if(board == null || board.length == 0)
            return false;
        if(word.length() == 0)
            return true;
        
        for(int i = 0; i< board.length; i++){
            for(int j=0; j< board[0].length; j++){
                if(board[i][j] == word.charAt(0)){
                    
                    boolean rst = find(board, i, j, word, 0);
                    if(rst)
                        return true;
                }
            }
        }
        return false;
    }
    
    private boolean find(char[][] board, int i, int j, String word, int start){
        if(start == word.length())
            return true;
        
        if (i < 0 || i>= board.length || 
     j < 0 || j >= board[0].length || board[i][j] != word.charAt(start)){
            return false;
	 }
        
        board[i][j] = '#'; // should remember to mark it
        boolean rst = find(board, i-1, j, word, start+1) 
|| find(board, i, j-1, word, start+1) 
|| find(board, i+1, j, word, start+1) 
|| find(board, i, j+1, word, start+1));
        board[i][j] = word.charAt(start);
        return rst;
    }
}