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.

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.

 

Constraints:

• board and word consists only of lowercase and uppercase English letters.
• 1 <= board.length <= 200
• 1 <= board[i].length <= 200
• 1 <= word.length <= 10^3

源码：

简单的回溯法，注意排重的问题。效率不是很高

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        int rows=board.size(), cols=board[0].size();
        vector<vector<bool>> visit(rows, vector<bool>(cols, false));
        bool result = false;
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                // visit[i][j] = true;
                result = help(board, word, visit, i, j, 0);
                // visit[i][j] = false;
                if(result)  return result;
            }
        }
        return result;
    }
    bool help(vector<vector<char>>& board, string& word, vector<vector<bool>>& visit,int row, int col, int index){
        int rows=board.size(), cols=board[0].size();
        if(index==word.size())    return true;
        if(row>=rows || row<0 || col>=cols || col<0)    return false;
        if(board[row][col] == word[index] && !visit[row][col]){
            visit[row][col] = true;
            bool tmp = help(board, word, visit, row+1, col, index+1) || help(board, word, visit, row-1, col, index+1) || help(board, word, visit, row, col+1, index+1) || help(board, word, visit, row, col-1, index+1);
            visit[row][col] = false;
            return tmp;
        }
        return false;
    }
};

在Discuss上面有个大佬的做法，感觉思路差的不是太多。就是去掉了visit，边界改成传送的方式

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        int rows=board.size(), cols=board[0].size();
        // vector<vector<bool>> visit(rows, vector<bool>(cols, false));
        bool result = false;
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                if(board[i][j] == word[0]){
                    if(word.size()==1)    return true;
                    result = help(board, word, rows, cols, i, j, 0);
                    if(result)  return result;   
                }
            }
        }
        return result;
    }
    bool help(vector<vector<char>>& board, string& word, int rows, int cols, int row, int col, int index){
        // int rows=board.size(), cols=board[0].size();
        if(index==word.size())    return true;
        if(row==rows || row<0 || col==cols || col<0)    return false;
        if(board[row][col] != word[index])      return false;
        char tempChar = board[row][col];
        board[row][col] = '#';
        bool tmp = help(board, word, rows, cols, row+1, col, index+1) || help(board, word, rows, cols, row-1, col, index+1) || help(board, word, rows, cols, row, col+1, index+1) || help(board, word, rows, cols, row, col-1, index+1);
        board[row][col] = tempChar;
        return tmp;
    }
};