LeetCode 212题单词搜索II

、sakura

已于 2022-03-28 23:36:05 修改

阅读量113

点赞数

文章标签： leetcode 深度优先算法

于 2022-01-26 10:55:56 首次发布

本文链接：https://blog.csdn.net/sakuraSD/article/details/122697245

版权

LeetCode 212题
这个就硬递归了
在这里插入图片描述

class Solution {
    List<String> resList = new ArrayList<>();

    public List<String> findWords(char[][] board, String[] words) {
        int row = board.length;
        int column = board[0].length;
        int length = words.length;
		for(int i = 0; i < row; i++){
            for(int j = 0; j < column; j++){
                for(int k = 0; k < length; k++){
                    if(board[i][j] == words[k].charAt(0)){
                        if(words[k].length() == 1 && !resList.contains(words[k])) {
                            resList.add(words[k]);
                            continue;
                        }
                        if(words[k].length() > row * column) {
                            continue;
                        }
                        dfs(board, words[k], i, j, 1, -1);
                    }
                }
            }
        }		
		return resList;
    }

    private void dfs(char[][] board, String word, int row, int column, int index, int way){
        if(index == word.length()) {
            return;
        }
         if(way != 2 && column + 1 < board[0].length && board[row][column + 1] == word.charAt(index)){
             if(index == word.length() - 1 && !resList.contains(word)) {//往右
                 resList.add(word);
                 return;
             }
			 dfs(board, word, row, column+1, index+1, 1);
         }
         if(way != 1 && column - 1 >= 0 && board[row][column - 1] == word.charAt(index)) {
             if(index == word.length() - 1 && !resList.contains(word)) {//往左
                 resList.add(word);
                 return;
             }
             dfs(board, word, row, column-1, index+1, 2);
		 }
         if(way != 4 && row + 1 < board.length && board[row + 1][column] == word.charAt(index)) {
		 if(index == word.length() - 1 && !resList.contains(word)) {//往下
			 resList.add(word);
			 return;
		 }
			dfs(board, word, row+1, column, index+1, 3);
		 }
         if(way != 3 && row - 1 >= 0 && board[row - 1][column] == word.charAt(index)) {
             if(index == word.length() - 1 && !resList.contains(word)) {//往上
                 resList.add(word);
                 return;
             }
             dfs(board, word, row-1, column, index+1, 4);
         }
	}
}