思路:
深度或者广度遍历,不过会浪费很多时间
class Solution:
def movingCount(self, m: int, n: int, k: int) -> int:
count=0
visited=[]
def sum(x):
y=0
while x!=0:
y=y+x%10
x=x//10
return y
def dfs(i,j):
nonlocal count,visited
if i>m-1 or j>n-1 or (i,j) in visited or sum(i)+sum(j)>k:
return
else:
count=count+1
visited.append((i,j))
dfs(i+1,j)
dfs(i,j+1)
dfs(0,0)
return count