【leetcode】1306. 跳跃游戏 III

递归 + 回溯
卡了我两天。。。一个运算优先级的问题
Java中 !的优先级弱于&& 所以!true&&true 结果是false

package pro1306;


import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * @Author: qiqu
 */
public class Solution {
    static boolean[] dest = new boolean[99999];
    static int[] s = new int[99999];
    static int length;
    static Set<Integer> set;
    public boolean canReach(int[] arr, int start) {
        Arrays.fill(dest, false);
        dest[start] = true;
        length = arr.length;
        set =new HashSet<>();
        int cnt = 0;
        for(int i=0; i<arr.length; i++){
            s[i]=arr[i];
        }
        if(arr[start] == 0) return true;
        return go(start, arr[start]);
    }

    boolean go(int cur, int step){
        if(cur + step>=0 && cur + step<length && !dest[cur + step]){
            if(s[cur + step] == 0) {
                return true;
            }
            dest[cur + step] = true;
            if(go(cur + step, s[cur + step])) {
                return true;
            }
            dest[cur + step] = false;
        }
        if(cur - step>=0 && cur - step<length && !dest[cur - step]){
            if(s[cur - step] == 0) {
                return true;
            }
            dest[cur - step] = true;
            if(go(cur - step, s[cur - step])) {
                return true;
            }
            dest[cur - step] = false;
        }
        return false;
    }
    
}