矩阵中的路径
设计一个函数,用来判断矩阵中是否存在一条包含字符串的路径
public class Offer17 {
public static void main(String[] args) {
char[][] data= {
{'a','s','d'},
{'z','x','c'},
{'q','w','e'},
};
char[] temp = new String("sxw").toCharArray();
System.out.println(hasPath(data,temp));
}
/**
* 回溯法
*/
public static boolean hasPath(char[][] data,char[] word){
//1.数据源判断
if(data.length==0)return false;
//2.新建记录矩阵
boolean[][] temp = new boolean[data.length][data[0].length];
//3.回溯
for(int i=0;i<data.length;i++){
for(int j=0;i<data[0].length;j++){
if(dfs(data,temp,word,i,j,0))return true;
}
}
return false;
}
public static boolean dfs(char[][] data,boolean[][] temp,char[] word,int i,int j,int index){
//越界问题
if(i<0||i>=data.length||j<0||j>=data[0].length||temp[i][j]==true)return false;
//字符不匹配
if(data[i][j]!=word[index])return false;
//以下情况为数据匹配情况
if(index==word.length-1)return true;
//标记访问
temp[i][j] = true;
boolean flag = dfs(data,temp,word,i+1,j,index+1)||
dfs(data,temp,word,i-1,j,index+1)||
dfs(data,temp,word,i,j+1,index+1)||
dfs(data,temp,word,i,j-1,index+1);
//匹配失败,需要把被访问标志改回来
temp[i][j] = false;
return flag;
}
}