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.

Example:

board =
[
[‘A’,‘B’,‘C’,‘E’],
[‘S’,‘F’,‘C’,‘S’],
[‘A’,‘D’,‘E’,‘E’]
]

Given word = “ABCCED”, return true.
Given word = “SEE”, return true.
Given word = “ABCB”, return false.

解题思路

回溯法回溯法

• 去搜索每一个可能的结果，在每一步都把所有可能尝试，如果不行就回溯上一个，详见

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        int rows=board.size();
        if(rows<=0)
            return false;
        int cols=board[0].size();
        int len=0;
        vector<vector<bool>> visited(rows, vector<bool>(cols,false));
        for(int row=0;row<rows;row++)
        {
            for(int col=0;col<cols;col++)
            {
                if(existCore(board, word, row, col, rows, cols, visited, len))
                    return true;
            }
        }
        return false;
    }
    bool existCore(vector<vector<char>>& board, string word, int row, int col, int rows, int cols, vector<vector<bool>>& visited, int& len)
    {
        bool exist=false;
        if(len==word.size())
            return true;
        if(row<rows&&0<=row&&0<=col&&col<cols&&!visited[row][col]&&word[len]==board[row][col])
        {
            visited[row][col]=true;
            len++;
            exist=(existCore(board, word, row-1, col, rows, cols, visited, len)||
                   existCore(board, word, row+1, col, rows, cols, visited, len)||
                   existCore(board, word, row, col+1, rows, cols, visited, len)||
                   existCore(board, word, row, col-1, rows, cols, visited, len));
            if(!exist)
            {
                visited[row][col]=false;
                len--;
            }
                
        }
        return exist;
    }
};

可以改进