算法
给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中,返回 true ;否则,返回 false 。
单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。
输入:board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
输出:true
直接用回溯就可以解决。
public class Main{
public static void main(String[] args){
char[][] b= {{'A','B','C','E'},{'S','F','C','S'},{'A','D','E','E'}};
String word="ABCCED";
boolean a=exist(b,word);
System.out.println(a);
}
public static boolean exist(char[][] board, String word) {
int h=board.length,l=board[0].length;
boolean[][] a=new boolean[h][l];
for(int i=0;i<h;i++) {
for(int j=0;j<l;j++) {
boolean f=app(board,a,i,j,word,0);
if(f) {
return true;
}
}
}
return false;
}
public static boolean app(char[][] board,boolean[][] a,int h,int l,String word,int k) {
if(board[h][l]!=word.charAt(k)) {
return false;
}else if(k==word.length()-1) {
return true;
}
a[h][l]=true;
int[][] ggg= {{0,1},{0,-1},{1,0},{-1,0}};
boolean result=false;
for(int[] j: ggg) {
int newh=h+j[0],newl=l+j[1];
if(newh>=0&&newl>=0&&newh<board.length&&newl<board[0].length) {
if(!a[newh][newl]){
boolean flag=app(board,a,newh,newl,word,k+1);
if(flag) {
result=true;
break;
}
}
}
}
a[h][l]=false;
return result;
}
public boolean check(char[][] board, boolean[][] visited, int i, int j, String s, int k) {
if (board[i][j] != s.charAt(k)) {
return false;
} else if (k == s.length() - 1) {
return true;
}
visited[i][j] = true;
int[][] directions = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
boolean result = false;
for (int[] dir : directions) {
int newi = i + dir[0], newj = j + dir[1];
if (newi >= 0 && newi < board.length && newj >= 0 && newj < board[0].length) {
if (!visited[newi][newj]) {
boolean flag = check(board, visited, newi, newj, s, k + 1);
if (flag) {
result = true;
break;
}
}
}
}
visited[i][j] = false;
return result;
}
}