Poison

55. Jump Game

发表于 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
    public boolean canJump(int[] nums) {
        int rightmost = nums[0];

        for (int i = 0; i < nums.length; i++) {
            if (rightmost < i) {
                return false;
            }

            rightmost = Math.max(rightmost, i + nums[i]);

            // 提前返回
            if (rightmost >= nums.length - 1) {
                return true;
            }
        }

        return true;
    }
}
Reference

55. Jump Game