本文共 785 字，大约阅读时间需要 2 分钟。

class Solution:    def canCross(self, stones: List[int]) -> bool:        dic = {   0:[0]}        for stone in stones[1:]:            dic[stone] = []        for i in range(len(stones)):            for value in dic[stones[i]]:                if stones[i] + value + 1 in dic and value + 1 not in dic[stones[i] + value + 1]:                    dic[stones[i] + value + 1].append(value + 1)                if stones[i] + value - 1 in dic and value - 1 not in dic[stones[i] + value - 1]:                    dic[stones[i] + value - 1].append(value - 1)                if stones[i] + value in dic and value not in dic[stones[i] + value]:                    dic[stones[i] + value].append(value)                if len(dic[stones[-1]] ):            return True        else:            return False

转载地址：http://hbsl.baihongyu.com/