55. 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.

bool canJump(int* nums, int numsSize) {
    bool * jumpFlag = (bool *)malloc(sizeof(bool)*numsSize);
    int i,j;

    if(nums == NULL || numsSize <= 0){
        return false;
    }

    /*initial*/
    jumpFlag[numsSize-1] = true;

    for(i = numsSize-2;i >= 0 ;--i){
        jumpFlag[i] = false;
        //printf("111");
        if(nums[i] > 0){
            for(j = 1;j <= nums[i]; ++j){
                if(jumpFlag[i+j] == true){
                    //printf("222");
                    jumpFlag[i] = true;
                    break;
                }            
            }
        }
    }

    return jumpFlag[0];
}