leetcode 79 单词搜索
dfs。需要注意的知识点:
二维数组定义:int array[][]=new int[3][3];
获取行长度 : int rowlength=array.length;
获取列长度:int colength=array[0].length;
Java substring方法可以获取字符串的子串。
dfs处理是否有解得问题时,注意找到一个解后,后续的check函数里面全部判否剪枝。
class Solution {
boolean flg = false;
int[] x = {-1,1,0,0};
int[] y = {0,0,1,-1};
int row = 0;
int col = 0;
boolean check(int i,int j,int[][] vis,String word,char[][] board,int pos){
if(flg) return false;// 找到一个解就可以了
if(i < 0 || i >= row || j < 0 || j >= col || !String.valueOf(board[i][j]).equals(word.substring(pos, pos+1)) || vis[i][j] == 1) return false;
return true;
}
void trackBack(int i, int j, String word, char[][] board, int pos, int[][] vis){
if(pos == word.length()){
flg = true;
}else{
for(int k = 0;k < 4;k++){
i += x[k];
j += y[k];
if(check(i, j, vis, word, board, pos)){
vis[i][j] = 1;
trackBack(i, j, word, board, pos+1, vis);
vis[i][j] = 0;
}
i -= x[k];
j -= y[k];
}
}
}
public boolean exist(char[][] board, String word) {
row = board.length;
col = board[0].length;
int[][] vis = new int[row][col];
for(int i = 0;i < row;i++){
for(int j = 0;j < col;j++){
if(String.valueOf(board[i][j]).equals(word.substring(0,1))){
trackBack(i-x[0], j-y[0], word, board, 0, vis);
if(flg) return true;
}
}
}
return flg;
}
}
54ms 38.9MB