摘要: 题目描述: 方法一:dfs/bfs class Solution: def movingCount(self, m: int, n: int, k: int) -> int: def digitsum(n): ans = 0 while n: ans += n %10 n//=10 return a 阅读全文
posted @ 2020-04-08 23:28 oldby 阅读(188) 评论(0) 推荐(0) 编辑