python解題 leetcde212. 單詞搜尋 II
阿新 • • 發佈:2018-11-11
題目:
給定一個二維網格 board 和一個字典中的單詞列表 words,找出所有同時在二維網格和字典中出現的單詞。
單詞必須按照字母順序,通過相鄰的單元格內的字母構成,其中“相鄰”單元格是那些水平相鄰或垂直相鄰的單元格。同一個單元格內的字母在一個單詞中不允許被重複使用。
示例:
輸入:
words = [“oath”,“pea”,“eat”,“rain”] and board =
[
[‘o’,‘a’,‘a’,‘n’],
[‘e’,‘t’,‘a’,‘e’],
[‘i’,‘h’,‘k’,‘r’],
[‘i’,‘f’,‘l’,‘v’]
]
輸出: [“eat”,“oath”]
程式碼
class TrieNode:
def __init__(self):
self.next = [None for i in range(26)]
self.word = None
class Solution(object):
def __init__(self): self.result = None self.m = None self.n = None def findWords(self, board, words): """ :type board: List[List[str]] :type words: List[str] :rtype: List[str] """ if len(board) == 0 or len(board[0])==0: return [] root = TrieNode() self.result = [] # build Trie![在這裡插入圖片描述](https://blog.csdn.net/u013949069/article/details/78056102) for word in words: curr = root for char in word: idx = ord(char)-97 if curr.next[idx] == None: curr.next[idx] = TrieNode() curr = curr.next[idx] curr.word = word # search on the board self.m, self.n = len(board), len(board[0]) for i in range(self.m): for j in range(self.n): self.dfs(board, i, j, root) return self.result def dfs(self, board, i, j, curr_node): tmp = board[i][j] if tmp == '#' or curr_node.next[ord(tmp) - 97] == None: return board[i][j] = '#' curr_node = curr_node.next[ord(tmp) - 97] if curr_node.word != None: self.result.append(curr_node.word) curr_node.word = None # cannot return immedially as there may still exist longer word moves = [[-1, 0], [1, 0], [0, -1], [0, 1]] for move in moves: if 0 <= i+move[0] < self.m and 0 <= j+move[1] < self.n: self.dfs(board, i+move[0], j+ move[1], curr_node) board[i][j] = tmp
#測試
words = [“oath”,“pea”,“eat”,“rain”]
board =[
[‘o’,‘a’,‘a’,‘n’],
[‘e’,‘t’,‘a’,‘e’],
[‘i’,‘h’,‘k’,‘r’],
[‘i’,‘f’,‘l’,‘v’]
]
A=Solution()
A.findWords(board=board,words=words)
print(A.result)