题目:
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
Python 代码:
# -*- coding:utf-8 -*-
class Solution:def __init__(self):
self.visted = []
def getData(self, data):
total = 0
while(data>0):
total += data%10
data /= 10
return total
def check(self, threshold, rows, cols, row, col):
if row>=0 and row<rows and col>=0 and col<cols and (self.getData(row)+self.getData(col))<=threshold and not self.visted[row*cols+col]:
return True
return False
def movingCountCore(self, threshold, rows, cols, row, col):
if self.check(threshold, rows, cols, row, col):
self.visted[row*cols+col] = 1
self.movingCountCore(threshold, rows, cols, row-1, col)
self.movingCountCore(threshold, rows, cols, row+1, col)
self.movingCountCore(threshold, rows, cols, row, col-1)
self.movingCountCore(threshold, rows, cols, row, col+1)
return
def movingCount(self, threshold, rows, cols):
# write code here
if threshold<0 or rows<=0 or cols<=0:
return 0
self.visted = [0]*rows*cols
self.movingCountCore(threshold, rows, cols, 0, 0)
return sum(self.visted)