403. Frog Jump

403. Frog Jump

Hard

2544163Add to ListShare

A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.

Given a list of stones' positions (in units) in sorted ascending order, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be 1 unit.

If the frog's last jump was k units, its next jump must be either k - 1, k, or k + 1 units. The frog can only jump in the forward direction.

Example 1:

Input: stones = [0,1,3,5,6,8,12,17]
Output: true
Explanation: The frog can jump to the last stone by jumping 1 unit to the 2nd stone, then 2 units to the 3rd stone, then 2 units to the 4th stone, then 3 units to the 6th stone, 4 units to the 7th stone, and 5 units to the 8th stone.

Example 2:

Input: stones = [0,1,2,3,4,8,9,11]
Output: false
Explanation: There is no way to jump to the last stone as the gap between the 5th and 6th stone is too large.

Constraints:

• 2 <= stones.length <= 2000
• 0 <= stones[i] <= 231 - 1
• stones[0] == 0
• stones is sorted in a strictly increasing order.

class Solution:
    def canCross(self, stones: List[int]) -> bool:
        """
        assert not Solution().canCross([0, 1, 2, 5, 6, 9, 10, 12, 13, 14, 17, 19, 20, 21, 26, 27, 28, 29, 30])
        assert not Solution().canCross([0, 2])
        assert Solution().canCross([0, 1, 3, 5, 6, 8, 12, 17])
        assert not Solution().canCross([0, 1, 2, 3, 4, 8, 9, 11])

        解体思路：dfs深搜剪枝，为了解决超时重复，额外加入标记状态dp集合用于标记错误
        """
        if stones[1] != 1:
            # 第一跳必须是1
            return False

        # 标记dp[数组下标][步长]失败方案
        dp = {k: {} for k in range(len(stones))}
        # 标记石头位置对应数组下标
        stone2Index = {v: k for k, v in enumerate(stones)}
        # 标记石头位置对应步长
        stone2Step = {k: 0 for k in stones}
        stone2Step[1] = 1

        def dfs(index: int) -> bool:
            if index >= len(stones) - 1:
                return True
            # 步长
            k = stone2Step[stones[index]]
            for i in [-1, 0, 1]:
                step = k + i
                if step <= 0:
                    continue
                nextStone = stones[index] + step
                if stone2Step.get(nextStone) is None:
                    # 没石头
                    continue
                if dp[index].get(step) is not None:
                    # 失败标记
                    continue
                stone2Step[nextStone] = step
                if dfs(stone2Index[nextStone]):
                    return True
                else:
                    # 记录该位置步长失败
                    dp[index][step] = False
                stone2Step[nextStone] = 0
            return False

        return dfs(1)