Word Search
Description:
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
Given board =
[
“ABCE”,
“SFCS”,
“ADEE”
]
word = “ABCCED”, -> returns true,
word = “SEE”, -> returns true,
word = “ABCB”, -> returns false.
Code:
class Solution:
"""
@param board: A list of lists of character
@param word: A string
@return: A boolean
"""
def search(self, board, word, i, j):
if word == "":
return True
if i<0 or j<0 or i>len(board)-1 or j>len(board[0])-1:
return False
if board[i][j]==word[0]:
board[i][j] = None
tmp = self.search(board, word[1:], i+1, j) or self.search(board, word[1:], i-1, j) or self.search(board, word[1:], i, j+1) or self.search(board, word[1:], i, j-1)
board[i][j] = word[0]
return tmp
def exist(self, board, word):
for i in range(len(board)):
for j in range(len(board[0])):
if self.search(board, word, i, j):
return True
return False