U1S1，看题解还是去leetcode上看，上面大佬讲的很清楚
矩阵中的路径
http://www.nowcoder.com/questionTerminal/c61c6999eecb4b8f88a98f66b273a3cc
U1S1，看题解还是去leetcode上看，上面大佬讲的很清楚
public boolean hasPath(char[] matrix, int rows, int cols, char[] str)
{
char[][] board = new char[rows][cols];
for (int i = 0; i < rows ; i++) {
for(int j = 0; j < cols; j++) {
board[i][j] = matrix[i*cols + j];
}
}
for(int i = 0; i < board.length; i++) {
for(int j = 0; j < board[0].length; j++) {
if(dfs(board, str, i, j, 0)) return true;
}
}
return false;
}
boolean dfs(char[][] board, char[] word, int i, int j, int k) {
if(i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != word[k]) return false;
if(k == word.length - 1)
return true;
char tmp = board[i][j];
board[i][j] = '/';
boolean res = dfs(board, word, i + 1, j, k + 1) || dfs(board, word, i - 1, j, k + 1) ||
dfs(board, word, i, j + 1, k + 1) || dfs(board, word, i , j - 1, k + 1);
board[i][j] = tmp;
return res;
}
]后边直接刨git，把一些导师做过的功能拿去问deepseek该怎么实现，然后直接一通乱编
