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

    class Solution {
    public:
        bool Sub(vector<vector<char> >&board,string& word,int index,int i,int j,vector<vector<bool> > &used){
            if(index==word.length())return true;
            if(i>=1&&!used[i-1][j]){
                used[i-1][j]=true;
                if(board[i-1][j]==word[index]&&Sub(board,word,index+1,i-1,j,used))return true;
                used[i-1][j]=false;
            }
            if(i<board.size()-1&&!used[i+1][j]){
                used[i+1][j]=true;
                if(board[i+1][j]==word[index]&&Sub(board,word,index+1,i+1,j,used))return true;
                used[i+1][j]=false;
            }
            if(j>=1&&!used[i][j-1]){
                used[i][j-1]=true;
                if(board[i][j-1]==word[index]&&Sub(board,word,index+1,i,j-1,used))return true;
                used[i][j-1]=false;
            }
            if(j<board[0].size()-1&&!used[i][j+1]){
                used[i][j+1]=true;
                if(board[i][j+1]==word[index]&&Sub(board,word,index+1,i,j+1,used))return true;
                used[i][j+1]=false;
            }
            return false;
        }
        bool exist(vector<vector<char> > &board, string word) {
            // Note: The Solution object is instantiated only once and is reused by each test case.
            if(word=="")return false;
            if(board.size()==0||board[0].size()==0)return false;
            vector<vector<bool> > used;
            vector<bool> one;
            one.resize(board[0].size(),false);
            used.resize(board.size(),one);
            for(int i=0;i<board.size();i++){
                for(int j=0;j<board[i].size();j++){
                    used[i][j]=true;
                    if(board[i][j]==word[0]&&Sub(board,word,1,i,j,used))return true;
                    used[i][j]=false;
                }
            }
            return false;
        }
    };
    View Code
  • 相关阅读:
    双链表
    单链表
    二叉树的遍历
    leetcode-9. 回文数
    leetcode-8. 字符串转换整数 (atoi)
    leetcode-7. 整数反转
    leetcode-6. Z 字形变换
    leetcode-5. 最长回文子串
    manacher-线性查找算法-(最长回文子串问题)
    bfprt-线性查找算法-(topK问题)
  • 原文地址:https://www.cnblogs.com/superzrx/p/3349490.html
Copyright © 2011-2022 走看看