剑指 Offer 12. 矩阵中的路径 法一：DFS
class Solution { char visited = '/'; public boolean exist(char[][] board, String word) { char[] words = word.toCharArray(); for(int i = 0;i < board.length;i++){ for(int j = 0;j<board[0].length;j++){ if( dfs(board,words,i,j,0) ) return true; } } return false; } public boolean dfs(char[][] board, char[] words, int i, int j, int cur){ if( i>=board.length || i<0 || j>=board[0].length || j<0 || words[cur] != board[i][j]) return false; if(cur == words.length-1) return true; char temp = board[i][j]; board[i][j] = visited; boolean res = dfs(board,words,i+1,j,cur+1)|| dfs(board,words,i-1,j,cur+1)|| dfs(board,words,i,j+1,cur+1)|| dfs(board,words,i,j-1,cur+1); board[i][j] = temp; return res; } }tip：由于该题中路径不能再次回到先前进过的格子，这里用board[i][j] = visited;，很nice，省去了visited[][]。
欢迎大家评论哟！如果本文对您有帮助，请点个赞，您的点赞对我很重要！这次一定！感谢！！！ 转发请注明出处呦！感谢！！！
