题目:机器人的运动范围
题:地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
解题思路:为使机器人达到更多的格子,应从(0,0)出发,当它进入(i,j)时,使用行列值数位和来判断能否进入
# -*- coding:utf-8 -*-
class Solution:
def movingCount(self, threshold, rows, cols):#threshold阈值,count格子数
# write code here
if threshold < 0 or rows < 1 or cols < 1:
return 0
markmatrix = [False] * (rows * cols)
count = self.movingCountCore(threshold, rows, cols, 0, 0, markmatrix)
return count
def movingCountCore(self, threshold, rows, cols, row, col, markmatrix):
value = 0
if self.check(threshold, rows, cols, row, col, markmatrix):
markmatrix[row * cols + col] = True
value = 1 + self.movingCountCore(threshold, rows, cols, row - 1, col, markmatrix) + \
self.movingCountCore(threshold, rows, cols, row + 1, col, markmatrix) + \
self.movingCountCore(threshold, rows, cols, row, col - 1, markmatrix) + \
self.movingCountCore(threshold, rows, cols, row, col + 1, markmatrix)
return value
def check(self, threshold, rows, cols, row, col, markmatrix):#满足要求返回True,否则False
if row >= 0 and row < rows and col >= 0 and col < cols and \
self.getDigitNum(row) + self.getDigitNum(col) <= threshold and not markmatrix[
row * cols + col]:
return True
return False
def getDigitNum(self, number):#目的求数位和
sum = 0
while (number > 0):
sum += number % 10
number = number // 10
return sum