题目描述
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
思路:1.当前格子在矩阵中
2.当前格子满足limit
3.当前格子没有走过(不重复)
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.vis = {}
def movingCount(self, threshold, rows, cols):
# write code here
return self.find(threshold, rows, cols, 0, 0)
def judge(self, threshold, row, col):
sums = 0
while row > 0: # while row: 不行复杂度太大
sums += row % 10
row /= 10
while col > 0:
sums += col % 10
col /= 10
return sums <= threshold
def find(self, threshold, rows, cols, row, col):
if not self.judge(threshold, row, col):
return 0
if not (0 <= row < rows and 0 <= col < cols): #没有row = rows,从0到rows - 1
return 0
if (row, col) in self.vis:
return 0
self.vis[(row, col)] = 1 # 添加dict的键,值
# 到第一个格子就已经有一次,所以前面有1
return 1 + self.find(threshold, rows, cols, row - 1, col) + self.find(threshold, rows, cols, row + 1, col) + self.find(threshold, rows, cols, row, col - 1) + self.find(threshold, rows, cols, row, col + 1)
**
不知道为什么def judge(self, threshold, row, col): return sum(map(int, str(row) + str(col))) <= threshold 不行 错误为ValueError: invalid literal for int() with base 10: ‘-’
**