题目:地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
class Solution:
def movingCount(self, k, rows, cols):
# 判断k, rows, cols
if k<0 or rows<=0 or cols<=0:
return 0
# 设置矩阵长度的列表,并全部标记为False
visited = [0]*(rows*cols)
for i in range(rows*cols):
visited[i] = False
count = self.movingCountCore(k, rows, cols, 0, 0, visited)
return count
def movingCountCore(self, k, rows, cols, row, col, visited):
count = 0
if self.check(k, rows, cols, row, col, visited):
visited[row*cols+col] = True
count = 1 + self.movingCountCore(k, rows, cols, row-1, col, visited) \
+self.movingCountCore(k, rows, cols, row+1, col, visited)\
+self.movingCountCore(k, rows, cols, row, col-1, visited)\
+self.movingCountCore(k, rows, cols, row, col+1, visited)
return count
# check用来判断机器人能否进入坐标为(row, col)的方格,而函数getDigitSum用来得到一个数字的数位之和
def check(self, k, rows, cols, row, col, visited):
if row>=0 and row<rows and col>=0 and col<cols and self.getDigit(row)+self.getDigit(col)<=k and not visited[row*cols+col]:
return True
return False
def getDigit(self, num):
sum = 0
while num>0:
sum += num%10
num /= 10
return sum
if __name__=="__main__":
solution = Solution()
a = solution.movingCount(9, 12, 12)
print(a)