摘要:
class Solution: def orangesRotting(self, grid: list[list[int]]) -> int: m,n=len(grid),len(grid[0]) queue,good=[],[] def bfs(queue,good,m,n,grid): time 阅读全文
posted @ 2023-08-27 12:57
Aneverforget
阅读(27)
评论(0)
推荐(0)
摘要:
class Solution: def combine(self, n: int, k: int): nums=[x+1 for x in range(n)] res,ans=[],[] def dfs(nums:list[int]): if len(ans)==k: ans_copy=ans.co 阅读全文
posted @ 2023-08-27 11:20
Aneverforget
阅读(37)
评论(0)
推荐(0)

浙公网安备 33010602011771号