package Backtrace;/*** @author dx* @version 1.0* @date 2022年6月2日 10:30* @description: 力扣79*/public class Find_Word {}class Find_Word_Solution{public boolean exit(char[][] board,String word){int h = board.length,w = board[0].length;boolean[][] visted = new boolean[h][w];for(int i = 0;i<h;i++){for(int j = 0;j<w;j++){boolean flag = check(board,visted,i,j,word,0);if(flag){return true;}}}return false;}public boolean check(char[][] board,boolean[][]visted,int i,int j,String s,int k){if(board[i][j] != s.charAt(k)){return false;}else if(k == s.charAt(k)){return true;}visted[i][j] = true; //回溯选择int [][] directions = {{0,1},{0,-1},{1,0},{-1,0}}; //上下左右boolean result = false;//当前节点上下左右都尝试for(int[] dir : directions) {int newi = i + dir[0], newj = j + dir[1];if (newi >= 0 && newi < board.length && newj >= 0 && newj < board[0].length) {if (!visted[newi][newj]) {boolean flag = check(board, visted, newi, newj, s, k + 1);if (flag) {result = true;break;}}}}visted[i][j] = false; //回溯剪枝return result;}}/*class Solution {public boolean exist(char[][] board, String word) {int h = board.length, w = board[0].length;boolean[][] visited = new boolean[h][w];for (int i = 0; i < h; i++) {for (int j = 0; j < w; j++) {boolean flag = check(board, visited, i, j, word, 0);if (flag) {return true;}}}return false;}public boolean check(char[][] board, boolean[][] visited, int i, int j, String s, int k) {if (board[i][j] != s.charAt(k)) {return false;} else if (k == s.length() - 1) {return true;}visited[i][j] = true;int[][] directions = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};boolean result = false;for (int[] dir : directions) {int newi = i + dir[0], newj = j + dir[1];if (newi >= 0 && newi < board.length && newj >= 0 && newj < board[0].length) {if (!visited[newi][newj]) {boolean flag = check(board, visited, newi, newj, s, k + 1);if (flag) {result = true;break;}}}}visited[i][j] = false;return result;}}*/
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。