leetcode 55. Jump Game

public class Solution {

/*
* 	public boolean canJump(int[] nums) {
int i;
int rightMost = 1;

if(nums.length==0 || nums == null)
return false;

for(i=0;i<nums.length;i++)
{
if(i+1>rightMost)
break;
rightMost = Math.max(rightMost, i+1+nums[i]);
}

if(rightMost >= nums.length)
return true;
else
return false;
}
*/
public boolean canJump(int[] nums) {
int i;
int rightMost = 0;

if(nums.length==0 || nums == null)
return false;

for(i=0;i<nums.length;i++)
{
if(i>rightMost)
break;
rightMost = Math.max(rightMost, i+nums[i]);
}

if(rightMost >= nums.length-1)
return true;
else
return false;
}

public static void main(String args[])
{
//int[] nums = {3,2,1,1,4};
int[] nums = {0};
boolean res = new Solution().canJump(nums);
System.out.println(res);
}
}