[LeetCode] Word Search

最新推荐文章于 2024-09-16 06:54:08 发布

lyangpku

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量508

点赞数

分类专栏： LeetCode 算法面试题文章标签： Leetcode leetcode LeetCode 算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8544589

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool DFS(vector<vector<char> > &board, vector<vector<bool> > &visited, string word, int i, int j, int n) {
        if (n == word.size()) return true;
        if (i < 0 || i >= board.size()) return false;
        if (j < 0 || j >= board[0].size()) return false;
        if (visited[i][j]) return false;
        if (board[i][j] != word[n]) return false;
        
        bool found = false;
        
        visited[i][j] = true;
        
        found = found || DFS(board, visited, word, i - 1, j, n + 1);
        found = found || DFS(board, visited, word, i + 1, j, n + 1);
        found = found || DFS(board, visited, word, i, j - 1, n + 1);
        found = found || DFS(board, visited, word, i, j + 1, n + 1);
        
        visited[i][j] = false;
        
        return found;
    }
    
    bool exist(vector<vector<char> > &board, string word) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (word.empty()) return true;
        int m = board.size();
        if (m == 0) return false;
        int n = board[0].size();
        if (n == 0) return false;
        
        vector<vector<bool> > visited(m, vector<bool>(n, false));
        
        for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            if (DFS(board, visited, word, i, j, 0))
                return true;
        
        return false;
    }
};

Small Case: 4ms

Large Case: 324ms

Time: O(4^n)

Space: O(n^2)

Simple DFS Problem.