矩阵中的路径
import java.util.*;
import java.util.Queue;
public class Solution {
public boolean hasPath (char[][] matrix, String word) {
char[] words = word.toCharArray();
if(words.length == 0 || ((matrix==null || matrix.length==0) || (matrix.length==1 && matrix[0].length==0))){
return false;
}
for(int i = 0; i < matrix.length; i++){
for(int j = 0; j < matrix[0].length; j++){
if(words[0] == matrix[i][j]){
boolean visit[][] = new boolean[matrix.length][matrix[0].length];
if(dfs(i,j,visit,matrix,0,words) == true)return true;
}
}
}
return false;
}
public boolean dfs(int m, int n, boolean[][] visit, char[][] matrix, int k, char[] words){
if(m < 0 || n < 0 || m >= matrix.length || n >= matrix[0].length || visit[m][n] == true){
return false;
}
if(words[words.length-1] == matrix[m][n] && (k == (words.length-1))){
return true;
}
if(words[k] == matrix[m][n]){
visit[m][n] = true;
if(dfs(m+1,n,visit,matrix,k+1,words) || dfs(m-1,n,visit,matrix,k+1,words) || dfs(m,n+1,visit,matrix,k+1,words) || dfs(m,n-1,visit,matrix,k+1,words)){
return true;
}else{
visit[m][n] = false;
return false;
}
}else{
visit[m][n] = false;
return false;
}
}
}