leetcode #79 in cpp

原创 2016年06月02日 09:50:56

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 =

[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]
word = "ABCCED", -> returns true,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.

Solution;

This is a basic DFS search for string. Simply find the first character and perform DFS in 4 direction for next characters. 

Code:

class Solution {
public:
    int dir[4][2] = {{1,0},{0,1}, {-1, 0}, {0,-1}}; 
    
    bool exist(vector<vector<char>>& board, string word) {
        if(board.empty()) return false;
        int m = board.size();
        int n = board[0].size();
        vector<vector<bool>> visited(m, vector<bool>(n, false)); 
        for(int i = 0; i < m; i ++){
            for(int j = 0; j < n; j ++){
                if(board[i][j] == word[0]){//find the match of the first character, then start from this point to locate the string
                    visited[i][j] = true;//note this position as visited. This is because 1 letter could be used once. 
                    if(search(i, j, 1,visited, word, board))
                        return true;
                    else visited[i][j] = false;//if next characters not found, go to find another starting point
                }
            }
        }
        return false; 
    }
    
    bool search(int cur_row, int cur_col,int search_pos, vector<vector<bool>> &visited, string &word, vector<vector<char>> &board)
    {   
        if(search_pos >= word.length()) return true;//if searching position is over the string length, 
<span style="white-space:pre">						</span>//it means we successfully reach the end
        //search for the letter at search_ind
        for(int i = 0; i < 4; i ++){//search for 4 directions
            int row = cur_row + dir[i][0];
            int col = cur_col + dir[i][1];
<span style="white-space:pre">		</span>//see if this position is out of bound and if this position has the character we want to find. If character matches,
<span style="white-space:pre">		</span>// go to the next recurrence for next character
            if(row < board.size() && row >=0 && col < board[0].size() && col >= 0 && !visited[row][col] && board[row][col] == word[search_pos]){
                visited[row][col] = true;
                if(search(row, col, search_pos+1, visited, word, board))
                    return true;
                else
                    visited[row][col] = false;
            }
        }
        return false;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode 79. Word Search (Medium) (cpp)

Leetcode 79. Word Search (Medium) (cpp)

leetcode #86 in cpp

Given a linked list and a value x, partition it such that all nodes less than x come before nodes gr...

leetcode #45 in cpp

Given an array of non-negative integers, you are initially positioned at the first index of the arra...

leetcode #149 in cpp

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line...

leetcode #24 in cpp

The question is to swap each pair in the linked list. And the requirement is to use constant space. ...

*leetcode #87 in cpp

Solution: Since the scramble is made by constructing a binary tree and swapping them randomly, we c...

leetcode #127 in cpp

Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest t...

leetcode #56 in cpp

Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6]...

leetcode #29 in cpp

The question is to divide two integer without multiplication,mod and division.  Solution:  The onl...

Leetcode 450. Delete Node in a BST (Medium) (cpp)

Leetcode 450. Delete Node in a BST (Medium) (cpp)
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)