Leetcode: Word Search

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

For example,
Given board =

[
  ["ABCE"],
  ["SFCS"],
  ["ADEE"]
]

word  =  "ABCCED" , -> returns  true ,
word  =  "SEE" , -> returns  true ,

word = "ABCB", -> returns false.

初看有些难度，其实就是简单的DFS。

class Solution {
public:
    bool exist(vector<vector<char> > &board, string word) {
        if (word.empty()) {
            return true;
        }
        if (board.empty()) {
            return false;
        }
        
        int rows = board.size();
        int cols = board[0].size();
        bool **used = new bool*[rows];
        for (int i = 0; i < rows; ++i) {
            used[i] = new bool[cols];
            memset(used[i], 0, sizeof(bool) * cols);
        }
        
        for (int i = 0; i < rows; ++i) {
            for (int j = 0; j < cols; ++j) {
                if (board[i][j] == word[0]) {
                    used[i][j] = true;
                    if (findWord(board, word, used, i, j, 1)) {
                        return true;
                    }
                    used[i][j] = false;
                }
            }
        }
        
        return false;
    }
    
    bool findWord(vector<vector<char> > &board, string word, bool **used, int i, int j, int step) {
        if (step == word.size()) {
            return true;
        }
        
        bool find = false;
        int rows = board.size();
        int cols = board[0].size();
        if (j < cols - 1 && board[i][j+1] == word[step] && !used[i][j+1]) {
            used[i][j+1] = true;
            find = findWord(board, word, used, i, j + 1, step + 1);
            used[i][j+1] = false;
        }
        if (!find && i < rows - 1 && board[i+1][j] == word[step] && !used[i+1][j]) {
            used[i+1][j] = true;
            find = findWord(board, word, used, i + 1, j, step + 1);
            used[i+1][j] = false;
        }
        if (!find && j > 0 && board[i][j-1] == word[step] && !used[i][j-1]) {
            used[i][j-1] = true;
            find = findWord(board, word, used, i, j - 1, step + 1);
            used[i][j-1] = false;
        }
        if (!find && i > 0 && board[i-1][j] == word[step] && !used[i-1][j]) {
            used[i-1][j] = true;
            find = findWord(board, word, used, i - 1, j, step + 1);
            used[i-1][j] = false;
        }
        
        return find;
    }
    
};

=======================第二次======================

想写的精简一点，在递归函数内部判断字符是否相等，超时。

class Solution {
public:
    bool exist(vector<vector<char> > &board, string word) {
        if (word.empty()) {
            return true;
        }
        
        vector<vector<bool>> used(board.size(), vector<bool>(board[0].size(), false));
        for (int i = 0; i < board.size(); ++i) {
            for (int j = 0; j < board[i].size(); ++j) {
                if (board[i][j] == word[0]) {
                    used[i][j] = true;
                    if (checkBoard(board, used, word, 1, i, j)) {
                        return true;
                    }
                    used[i][j] = false;
                }
            }
        }
        
        return false;
    }
    
    bool checkBoard(vector<vector<char>> &board, vector<vector<bool>> &used, const string &word, int start, int i, int j) {
        if (start == word.size()) {
            return true;
        }
        
        bool existed = false;
        if (!existed && i - 1 >= 0 && !used[i-1][j] && board[i-1][j] == word[start]) {
            used[i-1][j] = true;
            existed |= checkBoard(board, used, word, start+1, i-1, j);
            used[i-1][j] = false;
        }
        if (!existed && i + 1 < board.size() && !used[i+1][j] && board[i+1][j] == word[start]) {
            used[i+1][j] = true;
            existed |= checkBoard(board, used, word, start+1, i+1, j);
            used[i+1][j] = false;
        }
        if (!existed && j - 1 >= 0 && !used[i][j-1] && board[i][j-1] == word[start]) {
            used[i][j-1] = true;
            existed |= checkBoard(board, used, word, start+1, i, j-1);
            used[i][j-1] = false;
        }
        if (!existed && j + 1 < board[0].size() && !used[i][j+1] && board[i][j+1] == word[start]) {
            used[i][j+1] = true;
            existed |= checkBoard(board, used, word, start+1, i, j+1);
            used[i][j+1] = false;
        }
        
        return existed;
    }
};