1306. Jump Game III

最新推荐文章于 2023-05-11 05:55:53 发布

ForABiggerWorld

最新推荐文章于 2023-05-11 05:55:53 发布

阅读量230

点赞数

分类专栏： leetcode 递归

本文链接：https://blog.csdn.net/zjucor/article/details/104119622

版权

leetcode 同时被 2 个专栏收录

558 篇文章 0 订阅

订阅专栏

递归

26 篇文章 0 订阅

订阅专栏

本文介绍了一个数组跳跃游戏的问题，初始位于数组某个位置，目标是到达值为0的任意位置。通过分析给出的例子和约束条件，发现不能使用并查集，而是应该采用递归策略来解决。

摘要由CSDN通过智能技术生成

Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0.

Notice that you can not jump outside of the array at any time.

Example 1:

Input: arr = [4,2,3,0,3,1,2], start = 5
Output: true
Explanation: 
All possible ways to reach at index 3 with value 0 are: 
index 5 -> index 4 -> index 1 -> index 3 
index 5 -> index 6 -> index 4 -> index 1 -> index 3

Example 2:

Input: arr = [4,2,3,0,3,1,2], start = 0
Output: true 
Explanation: 
One possible way to reach at index 3 with value 0 is: 
index 0 -> index 4 -> index 1 -> index 3

Example 3:

Input: arr = [3,0,2,1,2], start = 2
Output: false
Explanation: There is no way to reach at index 1 with value 0.

Constraints:

1 <= arr.length <= 5 * 10^4
0 <= arr[i] < arr.length
0 <= start < arr.length

思路：并查集是不对的，因为连接不是双向的。直接用递归即可

class Solution(object):
    def canReach(self, arr, start):
        """
        :type arr: List[int]
        :type start: int
        :rtype: bool
        """
        vis=set()
        def helper(idx):
            if idx<0 or idx>=len(arr): return False
            if idx in vis: return False
            vis.add(idx)
            return arr[idx]==0 or helper(idx-arr[idx]) or helper(idx+arr[idx])
        return helper(start)
    
s=Solution()
print(s.canReach(arr = [4,2,3,0,3,1,2], start = 5))
print(s.canReach(arr = [4,2,3,0,3,1,2], start = 0))
print(s.canReach(arr = [3,0,2,1,2], start = 2))