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", -> returnstrue,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.

简单的深度优先遍历的题目,入门级别

public class Solution {
    
	static char[][] board;
    static boolean flag = false;
	static boolean[][] visited;
	static int row, col;
	static int wordSite;
	static char[] words;

	static int[][] next= new int[][]

	{
		{0, 1},
		{1, 0},
		{-1, 0},
		{0, -1}

	};

	public boolean exist(char[][] board, String word){
		flag = false;
		if(board != null && board[0] != null) {
			words = word.toCharArray();
			this.board = board;
			row = board.length;
			col = board[0].length;
			if(row * col < words.length)return false;
			visited = new boolean[row][col];
			for(int i = 0; i < row; ++i){
				Arrays.fill(visited[i], false);
			}
			wordSite = 0;
			for(int i = 0; i < row; ++i){
				for(int j = 0; j < col; ++j){
					if(!visited[i][j] && words[wordSite] == board[i][j]){
						visited[i][j] = true;
						wordSite ++;
						if(dfs(j, i)){
							return true;
						}
						visited[i][j] = false;
						wordSite --;
						if(flag)break;
					}
				}
				if(flag) break;
			}
		}
		return flag;
	}

	public boolean dfs(int x, int y){
		if(wordSite < words.length){
			for(int i = 0; i < next.length; ++i){
				int nextX = x + next[i][0], nextY = y + next[i][1];
				if(inBoard(nextX, nextY) && !visited[nextY][nextX] && board[nextY][nextX] == words[wordSite]){
					visited[nextY][nextX] = true;
					wordSite++;
					dfs(nextX, nextY);
					if(flag)break;
					visited[nextY][nextX] = false;
					wordSite--;
				}
			}
		}else{
			flag = true;
		}
		return flag;
	}

	public static boolean inBoard(int x, int y){
		return (y >=0 && y < row) && (x >= 0 && x < col);
	}
}