목록79. Word Search (1)

Scribbling

LeetCode: 79. Word Search

class Solution: def exist(self, board: List[List[str]], word: str) -> bool: n, m = len(board), len(board[0]) for i in range(n): for j in range(m): if self.dfs(board, i, j, word, 0): return True return False def dfs(self, board, y, x, word, k): if k == len(word): return True if y = len(board) or x = len(board[0]) or board[y][x] == '@': return False char = word[k] if board[y][x..
Computer Science/Coding Test 2021. 10. 1. 22:27
이전 Prev 1 Next 다음