[leetcode] 1306. Jump Game III

Description

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 * 104
• 0 <= arr[i] < arr.length
• 0 <= start < arr.length

分析

题目的意思是：求给定sart_index，按照arr里面的数向前向后走，是否可以走到arr值为0的位置。这道题最开始的想法就是递归，然后用visited数组记录已经走过的位置，避免递归无限循环，由于每次递归的时候有两种情况，干脆两种情况都递归就行了。

我看了一下其他人的解法，用的是dfs，大体思路差不多

代码

class Solution:
    def dfs(self,arr,idx,visited):
        if(visited[idx]==True):
            return False
        visited[idx]=True
        if(arr[idx]==0):
            return True
        val=arr[idx]
        upper=idx+val
        lower=idx-val
        flag=False
        if(upper>=0 and upper<len(arr)):
            flag=self.dfs(arr,upper,visited)
        if(flag):
            return True
        if(lower>=0 and lower<len(arr)):
            flag=self.dfs(arr,lower,visited)
        if(flag):
            return True
        return False
        
    def canReach(self, arr: List[int], start: int) -> bool:
        visited=[False for _ in range(len(arr))]
        res=self.dfs(arr,start,visited)
        return res

参考文献

LeetCode 1306 跳跃游戏 III Jump Game III