public static void main(String args[]) {
        JumpGame jumpGame = new JumpGame();
        int[] nums = {3, 2, 3, 0, 2, 1};
        System.out.println(jumpGame.jump(nums));
        int[] nums1 = {3, 0, 2, 0, 0, 1};
        System.out.println(jumpGame.canJump(nums1));
    }
Date 07/31/2016
@author Tushar Roy

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.

Time complexity O(n)
Space complexity O(1)

https://leetcode.com/problems/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.
Your goal is to reach the last index in the minimum number of jumps.

Time complexity O(n)
Space complexity O(1)

https://leetcode.com/problems/jump-game-ii/
src/com/interview/array/JumpGame.java