[leetcode] Jump Game I and II

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.(jump game I)

Your goal is to reach the last index in the minimum number of jumps.(jump game II)

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

思路： 贪心策略。计算每次能调到最远位置的那个index，如果跳的位置一样则选择最后一个index，如果遇到A[index] == 0的时候，则表示最远只能跳到当前位置，因为现在无法继续跳了（跳0步）。对于jump game II, 一样的方法，只是记录了一下跳的次数，这个次数一定是最小的，因为我们总是选择跳得最远的。

jump i:

public class Solution {
    public boolean canJump(int[] A) {
        int index = 0;
        int step = 0;
        if(A.length == 0 || A.length == 1)
            return true;
        while(index < A.length){
            int tmp = index;
            for(int i = tmp + 1; i < tmp + A[tmp] + 1; i++){
                if(i == A.length - 1)
                    return true;
                if(A[i] + i >= step){
                    step = A[i] + i;
                    index = i;
                }
            }
            if(A[index] == 0){
                return false;
            }
        }
        return true;
    }
}

jump ii:

public class Solution {
    public int jump(int[] A) {
        int index = 0;
        int step = 0;
        int result = 0;
        if(A.length == 0 || A.length == 1)
            return 0;
        while(index < A.length){
            result++;
            int tmp = index;
            for(int i = tmp + 1; i < tmp + A[tmp] + 1; i++){
                if(i == A.length - 1)
                    return result;
                if(A[i] + i >= step){
                    step = A[i] + i;
                    index = i;
                }
            }
        }
        return result;
    }
}