题目
地上有一个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
示例 2:
输入:m = 3, n = 1, k = 0
输出:1
提示:
1 <= n,m <= 100
0 <= k <= 20
解法
dfs
import numpy
class Solution:
def movingCount(self, m: int, n: int, k: int) -> int:
def bit_sum(x): # 计算x各个位置上的数和并返回
sum = 0
while x>0:
sum = sum + x%10
x = x//10
return sum
def dfs(x, y):
if x<0 or x>=m or y<0 or y>=n: # 判断坐标越界
return 0
if bit_sum(x)+bit_sum(y)>k:
return 0
if state[x][y]==0: # 如果当前未被记录,则标记,且继续搜素
state[x][y]=1
return 1 + dfs(x+1, y) + dfs(x, y+1) # 只需要考虑向下和向右的情况,向左和向上一定是已经标记过的
return 0
state = numpy.zeros((m, n))
return dfs(0,0)
bfs
import numpy as np
class Solution:
def movingCount(self, m: int, n: int, k: int) -> int:
def bit_sum(x):
bsum = 0
while x>0:
bsum = bsum+x%10
x = x//10
return bsum
def is_valid(x, y):
if x>=0 and x<m and y>=0 and y<n and state[x][y]==0 and bit_sum(x)+bit_sum(y)<=k:
return True
return False
queue = []
queue.append((0,0))
res = 0
state = np.zeros((m,n))
state[0][0]=1
while len(queue)>0:
res = res+1
out = queue.pop(0)
if is_valid(out[0], out[1]+1):
state[out[0]][out[1]+1] = 1
queue.append((out[0], out[1]+1))
if is_valid(out[0]+1, out[1]):
state[out[0]+1][out[1]] = 1
queue.append((out[0]+1, out[1]))
# if is_valid(out[0]-1, out[1]):
# state[out[0]-1][out[1]] = 1
# queue.append((out[0]-1, out[1]))
# if is_valid(out[0], out[1]-1):
# state[out[0]][out[1]-1] = 1
# queue.append((out[0], out[1]-1))
return res