45. Jump Game 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.

  Your goal is to reach the last index in the minimum number of jumps.

  For example: Given array A = [2,3,1,1,4]

  The minimum number of jumps to reach the last index is 2. (Jump 1
  step from index 0 to 1, then 3 steps to the last index.)

  Note: You can assume that you can always reach the last index

int calculateJump(int* nums, int numsSize,int *jumps) {
    int i,j;

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

    /*initial*/
    jumps[numsSize-1] = 0;

    for(i = numsSize-2; i >=0;i--){
         jumps[i] = 2147483647;
         if(nums[i] == 0){
            jumps[i] = -1;
         }else{
            for(j = 1;j<=nums[i];j++){
                if(jumps[i] > 0 && jumps[i+j] >= 0){
                    if((1 + jumps[i+j])<jumps[i]){
                        jumps[i] = 1 + jumps[i+j];
                    }
                }                
            } 
            if(jumps[i] == 2147483647){
                jumps[i] = -1;
            }
         }
    }

    return 0;
}

int jump(int* nums, int numsSize) {
    int *jumps = (int *)malloc(sizeof(int)*numsSize);      
    calculateJump(nums,numsSize,jumps);  
    return jumps[0];
}