机器人的运动范围
题目描述
地上有一个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 movingCount(self, threshold, rows, cols):
# write code here
if rows<1 or cols<1 or threshold<0:
return 0
visited = [False]*rows*cols
return self.movingCountcore(threshold, rows, cols, 0, 0, visited)
def movingCountcore(self, threshold, rows, cols, i, j, visited):
cnt = 0
if i>=0 and i<rows and j>=0 and j<cols and not visited[i*cols+j]:
if (self.calbitssum(i) + self.calbitssum(j)) <= threshold:
visited[i*cols+j] = True
cnt = 1 + (self.movingCountcore(threshold, rows, cols, i-1, j, visited)
+ self.movingCountcore(threshold, rows, cols, i+1, j, visited)
+ self.movingCountcore(threshold, rows, cols, i, j-1, visited)
+ self.movingCountcore(threshold, rows, cols, i, j+1, visited))
return cnt
def calbitssum(self, num):
sums = 0
while num!=0:
sums += num%10
num = num//10
return sums
经过在python端的实验,将这里的错误找到了。
class Solution:
def movingCount(self, threshold, rows, cols):
helpMatrix = [[False for i in range(cols)] for j in range(rows)]
# 下面这种写法在python端验证出问题,替换的时候会将整行或整列替换掉
# mask= [[False]*cols]*rows
return self.helpMethod(threshold,rows,cols,0,0,helpMatrix)
def helpMethod(self, threshold,rows,cols,i,j,helpMatrix):
if i<0 or i>=rows or j<0 or j>=cols or helpMatrix[i][j]==True:
return 0
if (i//10 + i%10 + j//10 + j%10) <= threshold:
helpMatrix[i][j] = True
return 1 + self.helpMethod(threshold,rows,cols,i+1,j,helpMatrix)\
+ self.helpMethod(threshold,rows,cols,i-1,j,helpMatrix)\
+ self.helpMethod(threshold,rows,cols,i,j-1,helpMatrix)\
+ self.helpMethod(threshold,rows,cols,i,j+1,helpMatrix)
else:
return 0