zoukankan      html  css  js  c++  java
  • 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.

    又是关于搜索的一道题,简单利用深度优先搜索能够实现要求,用c++实现比較不easy超时,相同使用java写出来可能会出现超时 错误,语言的差异问题没办法。

    class Solution {
    private:
        vector<vector<char> > *board;
        string *word;
        bool **used;
    private:
        bool isInboard(int i, int j)
        {
            if(i < 0)return false;
            if(i >= board->size())return false;
            if(j < 0)return false;
            if(j >= (*board)[i].size())return false;
            return true;
        }
    
        bool DFS(int si, int sj, int n)
        {
            if(n == word->size())return true;
            if(isInboard(si, sj))
          if(!used[si][sj] && (*board)[si][sj] == (*word)[n]){
                used[si][sj] = true;
    
                if(DFS(si+1, sj, n+1)){
                    return true;
                }else if(DFS(si-1, sj, n+1)){
                    return true;
                }else if(DFS(si, sj+1, n+1)){
                    return true;
                }else if(DFS(si, sj-1, n+1)){
                    return true;
                }
    
                //reset
                used[si][sj] = false;
    
                return false;
            }
            return false;
        }
    
    public:
        bool exist(vector<vector<char> > &board, string word) {
            if(board.size() == 0)return false;
            this->board = &board;
            this->word = &word;
            used = new bool*[board.size()];
            for(int i = 0; i < board.size(); i ++)
            {
                used[i] = new bool[board[i].size()];
                for(int j = 0; j < board[i].size(); j ++)
                    used[i][j] = false;
            }
            for(int i = 0; i < board.size(); i ++)
                for(int j = 0; j < board[i].size(); j ++)
                    if(DFS(i, j, 0))return true;
            return false;
        }
    };
    
    

  • 相关阅读:
    C# Socket UDP 案例
    精通MVC 3 框架Controller Extensibility
    python一些DEMO总结
    影响ASP.NET程序性能的因素
    Django实战
    EF 4.3 CodeBased 数据迁移演练
    jQuery Gallery Plugin在Asp.Net中使用
    Action Func委托+异步委托
    使用CGO封装Windows API
    每日一例,练就编程高手
  • 原文地址:https://www.cnblogs.com/blfshiye/p/5116633.html
Copyright © 2011-2022 走看看