地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
基本思路:判断当前位置是否满足条件,然后向上下左右扩展。
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.counter = 0
def movingCountCore(self, book, threshold, rows, cols, i, j):
temp_i = i
temp_j = j
temp_sum = 0
if i >= 0 and i < rows and j >= 0 and j < cols and book[i][j] == 0:
while temp_i:
temp_sum += temp_i % 10
temp_i = temp_i / 10
while temp_j:
temp_sum += temp_j % 10
temp_j = temp_j / 10
if temp_sum <= threshold:
book[i][j] = 1
self.counter += 1
self.movingCountCore(book, threshold, rows, cols, i - 1, j)
self.movingCountCore(book, threshold, rows, cols, i + 1, j)
self.movingCountCore(book, threshold, rows, cols, i, j - 1)
self.movingCountCore(book, threshold, rows, cols, i, j + 1)
def movingCount(self, threshold, rows, cols):
# write code here
book = [[0] * cols for i in range(rows)]
self.movingCountCore(book, threshold, rows, cols, 0, 0)
return self.counter