LeetCode 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.)

 /*************************************************************************
     > File Name: LeetCode045.c
     > Author: Juntaran
     > Mail: JuntaranMail@gmail.com
     > Created Time: Tue 13 May 2016 14:47:33 PM CST
  ************************************************************************/

 /*************************************************************************

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

  ************************************************************************/

 #include <stdio.h>

 int jump(int* nums, int numsSize)
 {
     if( numsSize <=  )
     {
         return ;
     }

     int left = nums[];
     int right = nums[];
     int count = ;
     int max = ;

     int i;
     for( i=; i<numsSize; i++ )
     {
         if( i > left )
         {
             left = right;
             count ++;
         }
         right = (i+nums[i])>right ? (i+nums[i]) : right;
         if( left >= numsSize- )
         {
             return count;
         }
     }
     return ;
 }

 int main()
 {
     int nums[] = {,,,,};
     int numsSize = ;

     int ret = jump( nums, numsSize );
     printf("%d\n", ret);

     return ;
 }