Leetcode Word Search 解题报告

题目来源： http://oj.leetcode.com/problems/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 class Solution {
    public boolean exist(char[][] board, String word) {
	if(word.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[i].length;j++) {
			visited[i][j] = false;
		}
	}
	
	for (int i=0;i<board.length;i++) {
		for (int j=0;j<board[i].length;j++) {
			if(board[i][j]==word.charAt(0)) {
				visited[i][j] = true;
				if(word.length()==1 || search(board,i,j,word.substring(1),visited)) {
					return true;
				}
				visited[i][j] = false;
			}
		}
	}
	return false;
}

boolean search(char[][] board, int i, int j, String word, boolean [][]visited) {
	if(word.length()==0) {
		return true;
	}
	//四个走向
	int[][] direction = { {-1,0},{1,0},{0,-1},{0,1}};
	
	for (int k=0;k<direction.length;k++) {
		int ii = i + direction[k][0];
		int jj = j + direction[k][1];
		if ( ii>=0&&ii<board.length&&
		     jj>=0&&jj<board[i].length&&
		     board[ii][jj]==word.charAt(0)&&
		     visited[ii][jj]==false) {
			visited[ii][jj] = true;
			if (word.length()==1 || search(board,ii,jj,word.substring(1),visited)) {
				return true;
			}
			visited[ii][jj] = false;
		}
	}
	return false;
}


}