摘要:
1 class Solution: 2 def dfs(self,grid,visited,x,y,m,n): 3 if x < 0 or x >= m or y < 0 or y >= n or visited[x][y] == 1: 4 return False 5 if x == m - 1
阅读全文
posted @ 2020-03-22 12:43
Sempron2800+
阅读(186)
推荐(0)
编辑
摘要:
1 class Solution: 2 def sumFourDivisors(self, nums: 'List[int]') -> int: 3 result = 0 4 n = len(nums) 5 for i in range(n): 6 s = set() 7 cur = nums[i]
阅读全文
posted @ 2020-03-22 12:38
Sempron2800+
阅读(166)
推荐(0)
编辑