Python | Leetcode Python题解之第403题青蛙过河
题目：
题解：
def canCross(stones: List[int]) -> bool:@lru_cache(None)def dfs(pos,step):if pos==stones[-1]: return Truefor d in [-1,0,1]:if step+d>0 and pos+step+d in set(stones):if dfs(pos+step+d, step+d):return Truereturn Falsepos, step = 0, 0return dfs(pos, step)