[LeetCode]403. Frog Jump

https://leetcode.com/problems/frog-jump/

用一个HashMap<Integer, HashSet<Integer>>记录位置index处前一步step是k时都失败的k的cache

public class Solution {
    public boolean canCross(int[] stones) {
        if (stones == null || stones[1] - stones[0] != 1) {
            return false;
        }
        HashMap<Integer, HashSet<Integer>> map = new HashMap();
        return canCross(stones, 1, 1, map);
    }
    private boolean canCross(int[] stones, int index, int step, HashMap<Integer, HashSet<Integer>> map) {
        if (index == stones.length - 1) {
            return true;
        } else if (step <= 0 || map.getOrDefault(index, new HashSet()).contains(step)) {
            return false;
        }
        boolean ret = false;
        for (int i = index + 1; i < stones.length; i++) {
            if (stones[index] + step == stones[i]) {
                ret |= canCross(stones, i, step, map);
            } else if (stones[index] + step + 1 == stones[i]) {
                ret |= canCross(stones, i, step + 1, map);
            } else if (stones[index] + step - 1 == stones[i]) {
                ret |= canCross(stones, i, step - 1, map);
            } else if (stones[index] + step + 1 < stones[i]) {
                break;
            }
            if (ret) {
                return true;
            }
        }
        HashSet<Integer> set = map.getOrDefault(index, new HashSet());
        set.add(step);
        map.put(index, set);
        return false;
    }
}