Leetcode#55||Jump Game

public class Solution {    public boolean canJump(int[] nums) {        if (nums == null || nums.length == 0) {            return false;        }                int maxRange = 0;                for (int i = 0; i < nums.length; i++) {            if (maxRange < i) {                return false;            }                        maxRange = Math.max(maxRange, i + nums[i]);        }                return true;    }}