# Middle-题目108：79. 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.

public class Solution {
public boolean exist(char[][] board, String word) {
int row = board.length;
if(row==0)
return false;
int col = board[0].length;
boolean[][] visited = new boolean[row][col];
for(int i = 0;i<row;i++) {
for(int j=0;j<col;j++) {
if(word.charAt(0) == board[i][j]) {
if(dfs(board, i, j, visited, word, 0))
return true;
}
}
}
return false;
}

private boolean dfs(char[][] board, int i, int j, boolean[][] visited, String word, int index) {
if(index == word.length())
return true;
else if(i<0 || i>board.length-1 || j<0 || j>board[0].length-1 || word.charAt(index)!=board[i][j] || visited[i][j])
return false;
else {
visited[i][j]=true;
boolean result = dfs(board, i-1, j, visited, word, index+1) || dfs(board, i+1, j, visited, word, index+1) || dfs(board, i, j-1, visited, word, index+1) || dfs(board, i, j+1, visited, word, index+1);
visited[i][j] = false;
return result;
}

}
}

13ms,beats 58.16%,众数14ms,14.58%
cmershen的碎碎念：

• 本文已收录于以下专栏：

举报原因： 您举报文章：Middle-题目108：79. Word Search 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)