【力扣剑指 Offer 13. 机器人的运动范围】bfs可达性分析（python3）

题目描述

https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/

思路题解

https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/solution/mian-shi-ti-13-ji-qi-ren-de-yun-dong-fan-wei-dfs-b/

from collections import deque

class Solution:
    def movingCount(self, m: int, n: int, k: int) -> int:
        d={}
        ans=1
        q=deque()
        visited=[[0]*n for _ in range(m)]
        for i in range(max(m,n)):
            d[i]=sum(list(map(int,list(str(i)))))
        q.append((0,0))
        visited[0][0]=1
        while q:
            i,j=q.popleft()
            if i+1<m and d[i+1]+d[j]<=k and visited[i+1][j]==0:
                ans+=1
                q.append((i+1,j))
                visited[i+1][j]=1
            # if i-1>=0 and d[i-1]+d[j]<=k and visited[i-1][j]==0:
            #     ans+=1
            #     q.append((i-1,j))
            #     visited[i-1][j]=1
            if j+1<n and d[i]+d[j+1]<=k and visited[i][j+1]==0:
                ans+=1
                q.append((i,j+1))
                visited[i][j+1]=1
            # if j-1>=0 and d[i]+d[j-1]<=k and visited[i][j-1]==0:
            #     ans+=1
            #     q.append((i,j-1))
            #     visited[i][j-1]=1
        return ans