DFS,当前位置为0时,返回true,不是0,如果已经见过这个位置,则返回False,新的位置小于0或者大于arr长度也返回False。
class Solution:
def canReach(self, arr: List[int], start: int) -> bool:
target = 0
for idex, num in enumerate(arr):
if num == 0:
target = idex
break
def dfs(pos, arr, meet):
if pos < 0:return False
if pos >= len(arr):return False
if pos in meet:return False
meet.add(pos)
if arr[pos] == 0:return True
newpos1 = pos - arr[pos]
newpos2 = pos + arr[pos]
return dfs(newpos1, arr, meet) or dfs(newpos2, arr, meet)
return dfs(start, arr, set())