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

/*************************************************************************
    > File Name: LeetCode055.c
    > Author: Juntaran
    > Mail: JuntaranMail@gmail.com
    > Created Time: Wed 11 May 2016 20:30:25 PM CST
 ************************************************************************/
 
/*************************************************************************
    
    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.

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

#include <stdio.h>

#define MAX(a,b) ((a)>(b) ? (a) : (b))

int canJump(int* nums, int numsSize) {
    
    int sum = 0;
    
    int i;
    for( i=0; i<numsSize && sum<=numsSize; i++ )
    {
        if (i > sum) 
        {
            return 0;
        }
        sum = MAX( nums[i]+i, sum );
        printf("sum is %d
", sum);
    }
    return 1;
}

int main() 
{
    int nums[] = { 2,3,1,1,4 };
    int numsSize = 5;
    
    int ret = canJump( nums, numsSize );
    printf("%d
", ret);
    
    return 0;
}