LeetCode: Jump Game II

第一次给每个值都算最远距离，结果large没过，第二次用了现在的方法稍微改了改，最后过了，少数次过吧

class Solution {
public:
    int jump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int left, right, index;
        left = right = index = 0;
        while (right < n-1) {
            index++;
            int rmax = left+A[left];
            for (int i = left+1; i <= right; i++) {
                rmax = max(rmax, i+A[i]);
            }
            left = right;
            right = rmax;
        }
        return index;
    }
};

 C#

public class Solution {
    public int Jump(int[] nums) {
        int left = 0, right = 0, index = 0;
        while (right < nums.Length-1) {
            index++;
            int rmax = left + nums[left];
            for (int i = left + 1; i <= right; i++) rmax = Math.Max(rmax, i + nums[i]);
            left = right;
            right = rmax;
        }
        return index;
    }
}