MCPcopy Create free account
hub / github.com/HuberTRoy/leetCode / find

Method find

DFS/WordSearchII.py:90–114  ·  view source on GitHub ↗
(board, x, y, word, pre)

Source from the content-addressed store, hash-verified

88 t['!'] = '!'
89
90 def find(board, x, y, word, pre):
91 # print(word)
92 if '!' in word:
93 result.append(pre)
94
95 for w in word:
96 raw = board[y][x]
97 board[y][x] = 0
98
99 # up
100 if y-1 >= 0 and board[y-1][x] == w:
101 find(board, x, y-1, word[w], pre+w)
102 # down
103 if y+1 < len(board) and board[y+1][x] == w:
104 find(board, x, y+1, word[w], pre+w)
105
106 # left
107 if x-1 >= 0 and board[y][x-1] == w:
108 find(board, x-1, y, word[w], pre+w)
109
110 # right
111 if x+1 < len(board[0]) and board[y][x+1] == w:
112 find(board, x+1, y, word[w], pre+w)
113
114 board[y][x] = raw
115
116 maps = {}
117

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected