LeetCode 动态规划入门 Day4 Java

55. 跳跃游戏

代码:

class Solution {
    public boolean canJump(int[] nums) {
        int maxS=0;
        int n = nums.length;
        for(int i=0;i<n;i++){
            if(i<=maxS)
                {
                    maxS=Math.max(maxS,nums[i]+i);
                    if(maxS>=n-1)
                        return true;
                }
        }
        return false;
    }
}

 思路:

 45. 跳跃游戏 II

问题描述:

 代码:

class Solution {
    public int jump(int[] nums) {
        int length = nums.length;
        int end = 0;
        int maxPosition = 0; 
        int steps = 0;
        for (int i = 0; i < length - 1; i++) {
            maxPosition = Math.max(maxPosition, i + nums[i]); 
            if (i == end) {
                end = maxPosition;
                steps++;
            }
        }
        return steps;
    }
}

思路: