Jump Game

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.

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

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

思路：
最开始用动规，结果超时。后来使用贪心，用step记录每一步可以最多向后移动的距离，AC。

代码：

    int max(int a, int b){
        if(a > b)
            return a;
        return b;
    }
    bool canJump(int A[], int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(n == 0)
            return false;
        int step = A[0], i;
        for(i = 1; i < n; i++){
            if(step > 0)
                step = max(step-1, A[i]);
            else
                return false;
        }
        return true;
    }