【LeetCode】79. 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 =

[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

word = "ABCCED", -> returns true,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.

解题思路

深搜
先遍历整个矩阵，找到入口点。然后，每次遍历四个方向，如果与当前字符匹配，就继续向下搜索。

AC代码

class Solution {
public:
    // right, down, left, up
    const vector<vector<int>> dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
    int m, n;

    // 判断是否超越边界
    bool isLegal(int x, int y) {
        return (x >= 0 && x < m && y >= 0 && y < n);
    }

    bool dfs(const vector<vector<char>>& board, vector<vector<bool>>& isVisited, string word, int row, int col, int idx) {
        if (idx >= word.size())
            return true;

        for (int i = 0; i < 4; ++i) {
            int curRow = row + dir[i][0];
            int curCol = col + dir[i][1];
            if (isLegal(curRow, curCol) && !isVisited[curRow][curCol] && board[curRow][curCol] == word[idx]) {
                isVisited[curRow][curCol] = true;
                if (dfs(board, isVisited, word, curRow, curCol, idx + 1))
                    return true;
                //回溯    
                isVisited[curRow][curCol] = false;
            }
        }

        return false;
    }

    bool exist(vector<vector<char>>& board, string word) {
        m = board.size(); if (!m) return false;
        n = board[0].size(); if (!n) return false; 

        vector<vector<bool>> isVisited;
        for (int i = 0; i < m; ++i) {
            vector<bool> temp(n, false);
            isVisited.push_back(temp);
        }

        // find entrance
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (board[i][j] == word[0]) {
                    isVisited[i][j] = true;
                    if (dfs(board, isVisited, word, i, j, 1)) return true;
                    isVisited[i][j] = false;
                }
            }
        }

        return false;
    }
};