Description
地上有一个m行n列的方格,从坐标 [0,0] 到坐标 [m-1,n-1] 。一个机器人从坐标 [0, 0] 的格子开始移动,它每次可以向左、右、上、下移动一格(不能移动到方格外),也不能进入行坐标和列坐标的数位之和大于k的格子。例如,当k为18时,机器人能够进入方格 [35, 37] ,因为3+5+3+7=18。但它不能进入方格 [35, 38],因为3+5+3+8=19。请问该机器人能够到达多少个格子?
示例 1:
输入:m = 2, n = 3, k = 1
输出:3
示例 1:
输入:m = 3, n = 1, k = 0
输出:1
提示:
1 <= n,m <= 100
0 <= k <= 20
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Solution
BFS板题改一下即可。
class Solution:
def movingCount(self, m: int, n: int, k: int) -> int:
grid = [[0 for _ in range(n)] for __ in range(m)]
def neighbors(r, c):
for nr, nc in ((r-1,c),(r,c-1),(r+1,c),(r,c+1)):
if 0 <= nr < m and 0 <= nc < n:
yield nr, nc # 生成器是亮点
def lessThanK(nr, nc, k):
rc = str(nr)+str(nc)
rc = [int(char) for char in rc]
return sum(rc)<=k
queue = collections.deque()
queue.append((0,0))
grid[0][0] = 1
res = 1
while queue:
r, c = queue.popleft()
for nr, nc in neighbors(r, c):
if grid[nr][nc] == 0 and lessThanK(nr,nc,k):
queue.append((nr,nc))
grid[nr][nc] = 1
res += 1
return res