leetCode 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.

给个二维数组，再给个字符串，遍历的时候可以上下左右拐弯，每个字符只能用一次

深度优先遍历，不成功回溯时要把原来的字符复原

public boolean exist(char[][] board, String word) {
		boolean b = false;
   loop:for (int i=0; i<board.length; i++) {
			for (int j=0; j<board[0].length; j++) {
				if (dfs(board, word, 0, i, j)) {
					b = true;
					break loop;
				}
					
			}
		}
		return b;
    }
	
	boolean dfs(char[][] board, String word, int n, int x, int y) {
		if (n == word.length()) {
			return true;
		}
		//check the border
		if (x >= 0 && y >= 0 && x < board.length 
		&& y < board[x].length && board[x][y] == word.charAt(n)) { 
			char temp = board[x][y];
			//use '#' to indicate that the char is used
			board[x][y] = '#';
			boolean up, right, down, left;
			up = dfs(board, word, n+1, x-1, y);
			right = dfs(board, word, n+1, x, y+1);
			down = dfs(board, word, n+1, x+1, y);
			left = dfs(board, word, n+1, x, y-1);
			if (up || right || down || left) {
				return true;
			} else {  //backtrack
				board[x][y] = temp;
				return false;
			}
		}
		return false;
	}