Skip to content

Commit 2e29578

Browse files
committed
word-search
1 parent 2ccc7e2 commit 2e29578

8 files changed

+64
-0
lines changed

word-search.docx

-13 KB
Binary file not shown.

word-search.py

+32
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
# https://leetcode.com/problems/word-search/submissions/
2+
3+
class Solution:
4+
def DFS(self,row, col, curr, board, word):
5+
if 0 <= row < len(board) and 0 <= col < len(board[0]) and board[row][col] == word[curr]:
6+
temp = board[row][col]
7+
board[row][col] = '#'
8+
9+
if curr == len(word)-1:
10+
return True
11+
12+
result = self.DFS(row-1, col, curr+1, board, word) or self.DFS(row+1, col, curr+1, board, word) or self.DFS(row, col-1, curr+1, board, word) or self.DFS(row, col+1, curr+1, board, word)
13+
14+
board[row][col] = temp
15+
16+
return result
17+
else:
18+
return False
19+
20+
21+
def exist(self, board: List[List[str]], word: str) -> bool:
22+
23+
for row in range(len(board)):
24+
for col in range(len(board[0])):
25+
26+
check = self.DFS(row, col, 0, board, word)
27+
28+
if check:
29+
return True
30+
31+
return False
32+

word-search/word-search.docx

13.7 KB
Binary file not shown.

word-search/word-search.pdf

76.3 KB
Binary file not shown.

word-search/word-search.pptx

65.2 KB
Binary file not shown.

word-search/word-search.py

+32
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
# https://leetcode.com/problems/word-search/submissions/
2+
3+
class Solution:
4+
def DFS(self,row, col, curr, board, word):
5+
if 0 <= row < len(board) and 0 <= col < len(board[0]) and board[row][col] == word[curr]:
6+
temp = board[row][col]
7+
board[row][col] = '#'
8+
9+
if curr == len(word)-1:
10+
return True
11+
12+
result = self.DFS(row-1, col, curr+1, board, word) or self.DFS(row+1, col, curr+1, board, word) or self.DFS(row, col-1, curr+1, board, word) or self.DFS(row, col+1, curr+1, board, word)
13+
14+
board[row][col] = temp
15+
16+
return result
17+
else:
18+
return False
19+
20+
21+
def exist(self, board: List[List[str]], word: str) -> bool:
22+
23+
for row in range(len(board)):
24+
for col in range(len(board[0])):
25+
26+
check = self.DFS(row, col, 0, board, word)
27+
28+
if check:
29+
return True
30+
31+
return False
32+

~$rd-search.docx

-162 Bytes
Binary file not shown.

~WRL1840.tmp

-12.9 KB
Binary file not shown.

0 commit comments

Comments
 (0)