(java)leetcode-79:Word Search

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.

解题思路：

我的想法就是先找到满足第一个字符的位置，然后用递归的方式查找该位置周围有没有跟下一个字符相等的，有的话就不断继续直到全部都找到，返回true。反之则返回false。只要接收到一个true就停止遍历返回true。因为不能一个字符用多次，所以当当前字符匹配时，我用空格' '代替原字符，继续查找。看了一下leetcode里面排在前面的答案的思路跟我的是差不多的，就是代码比我简洁很多...

public class Solution {
    public boolean exist(char[][] board, String word) {
        if(word == null || word.length() == 0)
        	return true;
        if(board == null || board.length == 0 || board[0].length == 0)
        	return false;
        char c = word.charAt(0);
        for(int i = 0;i<board.length;i++)
        {
        	for(int j = 0;j<board[0].length;j++)
        	{
        		if(board[i][j] == c)
        		{
        			board[i][j] = ' ';
        			if(findword(board,word,1,i,j) == true)
        				return true;
        			board[i][j] = c;
        		}
        	}
        }
        return false;
    }
	public boolean findword(char[][] board,String word,int index,int rowindex,int colindex)
	{
		if(index >= word.length())
			return true;
		char c = word.charAt(index);
		if(rowindex > 0 && board[rowindex-1][colindex] == c)
		{
			board[rowindex-1][colindex] = ' ';
			if(findword(board,word,index+1,rowindex-1,colindex) == true)
				return true;
			board[rowindex-1][colindex] = c;
		}
		if(rowindex < board.length-1 && board[rowindex+1][colindex] == c)
		{
			board[rowindex+1][colindex] = ' ';
			if(findword(board,word,index+1,rowindex+1,colindex) == true)
				return true;
			board[rowindex+1][colindex] = c;
		}
		if(colindex > 0 && board[rowindex][colindex-1] == c)
		{
			board[rowindex][colindex-1] = ' ';
			if(findword(board,word,index+1,rowindex,colindex-1) == true)
				return true;
			board[rowindex][colindex-1] = c;
		}
		if(colindex < board[0].length-1 && board[rowindex][colindex+1] == c)
		{
			board[rowindex][colindex+1] = ' ';
			if(findword(board,word,index+1,rowindex,colindex+1) == true)
				return true;
			board[rowindex][colindex+1] = c;
		}
		return false;
	}
}