LeetCode-面试题13. 机器人的运动范围-中等
地上有一个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
代码:
class Solution:
def movingCount(self, m: int, n: int, k: int) -> int:
ans = 1
def numsum(x):
tmp = 0
while x:
tmp += x % 10
x = x // 10
return tmp
dp = [[False for j in range(n)] for i in range(m)]
dp[0][0] = True
for i in range(m):
for j in range(n):
if numsum(i)+numsum(j) <= k and ((i > 0 and dp[i-1][j]) or (j > 0 and dp[i][j-1])):
ans += 1
dp[i][j] = True
return ans
# class Solution:
# def movingCount(self, m: int, n: int, k: int) -> int:
# ans = 0
# def numsum(x):
# tmp = 0
# while x:
# tmp += x % 10
# x = x // 10
# return tmp
# dp = []
# for j in range(n):
# if numsum(j) <= k:
# dp.append(True)
# else:
# for jj in range(j, n):
# dp.append(False)
# break
# for i in range(m):
# for j in range(n):
# if numsum(i)+numsum(j) <= k and (dp[j] or (j > 0 and dp[j-1])):
# ans += 1
# dp[j] = True
# else:
# dp[j] = False
# return ans