LeetCode 79: Word Search

LeetCode 79: Word Search

这里有两段代码，思路基本一致，都为深度优先搜索。代码一先进行递归，再在函数中判断是否符合条件；代码二先判断是否符合条件，再进行递归。但是代码二在大数据时超时，还没发现原因。

代码一

public class Solution {
    public boolean exist(char[][] board, String word) {

        if (board.length == 0 || word.length() == 0) return false;
        int row = board.length, column = board[0].length;

        //initial
        boolean[][] flag = new boolean[row][column];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                flag[i][j] = false;
            }
        }
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if (exist(board, flag, word, 0, i, j)) return true;
            }
        }
        return false;
    }

    public boolean exist(char[][] board, boolean[][] flag, String word, int index, int i, int j) {
        if (index == word.length()) {
            return true;
        }
        if (i < 0 || j < 0 || i >= board.length || j >= board[0].length) 
            return false;
        if (flag[i][j]) return false;
        if (board[i][j] != word.charAt(index)) return false;

        flag[i][j] = true;
        boolean ret = exist(board, flag, word, index + 1, i - 1, j) 
                || exist(board, flag, word, index + 1, i, j - 1) 
                || exist(board, flag, word, index + 1, i + 1, j) 
                || exist(board, flag, word, index + 1, i, j + 1);

        flag[i][j] = false;
        return ret;
    }
}

代码二

public class Solution {
    public boolean exist(char[][] board, String word) {

        if (board.length == 0 || word.length() == 0) return false;
        int row = board.length, column = board[0].length;

        //initial
        boolean[][] flag = new boolean[row][column];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                flag[i][j] = false;
            }
        }
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if (board[i][j] == word.charAt(0) && !flag[i][j]) {
                    if (exist(board, flag, word, 0, i, j)) return true;
                }
            }
        }
        return false;
    }

    public boolean exist(char[][] board, boolean[][] flag, String word, int index, int i, int j) {
        if (index == word.length() - 1) {
            return true;
        }
        int row = board.length, column = board[0].length;        
        flag[i][j] = true;
        boolean up = false, down = false, right = false, left = false;
        index++;

        if (i - 1 >= 0 && board[i - 1][j] == word.charAt(index) && !flag[i - 1][j]) { //up
            up =  exist(board, flag, word, index, i - 1, j);
        }
        if (j - 1 >= 0 && board[i][j - 1] == word.charAt(index) && !flag[i][j - 1]) { //left
            left =  exist(board, flag, word, index, i, j - 1);
        }
        if (i + 1 < row && board[i + 1][j] == word.charAt(index) && !flag[i + 1][j]){ //down
            down =  exist(board, flag, word, index, i + 1, j);
        }
        if (j + 1 < column && board[i][j + 1] == word.charAt(index) && !flag[i][j + 1]) { //right
            right =  exist(board, flag, word, index, i, j + 1);
        }

        flag[i][j] = false;
        return (up || down || left || right);
    }
}

总结

1. 程序有std输出时会耗时，Leetcode代码中要注释掉调试的std输出语句。