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.

    分析:遍历board找到和word首字母相同的位置,然后从该位置dfs看能否生成word。进行dfs时,对当前位置分别访问上下左右四个位置,如果这些位置中的字母和word的下一个字母相同,则从这些位置继续搜索。对于board中元素已访问的标志可以设一个访问标志数组,也可以把已访问的元素设置成某个字符,比如本文的代码就是设置成“#”,对该位置搜索完后要恢复原来的字母。                                                                     本文地址

    class Solution {
    public:
        bool exist(vector<vector<char> > &board, string word) {
            const int row = board.size();
            if(row == 0)return false;
            const int col = board[0].size();
            for(int i = 0; i < row; i++)
                for(int j = 0; j < col; j++)
                    if(board[i][j] == word[0] && dfs(i, j, word, 0, board))
                        return true;
            return false;
        }
        
        bool dfs(int row, int col, string &word, int index, 
            vector<vector<char> > &board)
        {
            if(index == word.size() - 1)return true;
            char ctmp = board[row][col];
            board[row][col] = '#';//标志为已访问
            //上
            if(row-1 >=0 && board[row-1][col] == word[index+1])
                if(dfs(row-1, col, word, index+1, board))
                    return true;
            //下
            if(row+1 < board.size() && board[row+1][col] == word[index+1])
                if(dfs(row+1, col, word, index+1, board))
                    return true;
            //左
            if(col-1 >=0 && board[row][col-1] == word[index+1])
                if(dfs(row, col-1, word, index+1, board))
                    return true;
            //右
            if(col+1 < board[0].size() && board[row][col+1] == word[index+1])
                if(dfs(row, col+1, word, index+1, board))
                    return true;
            board[row][col] = ctmp;//恢复原来的字母
            return false;
        }
    };

    【版权声明】转载请注明出处:http://www.cnblogs.com/TenosDoIt/p/3461519.html

  • 相关阅读:
    AJAX局部刷新
    jquery 调用数据
    java 节点流(字符流,字节流)和包装流(缓冲流,转换流)
    java File类的使用以及一些函数
    java 自定义泛型
    java 注解
    jdbc baseDAO 以及 每个类的继承
    jdbc 事物 commit 和rollback方法
    jdbc 可处理数据库事物的通用增删查改函数
    jdbc 数据库批处理insert操作
  • 原文地址:https://www.cnblogs.com/TenosDoIt/p/3461519.html
Copyright © 2011-2022 走看看