代码随想录day28：贪心part2，做过就是思路

day28：贪心part2

122.买卖股票的最佳时机 II

class Solution {
    public int maxProfit(int[] prices) {
        int profit = 0;
        for (int i = 1; i < prices.length; i++) {
            profit += Math.max(0, prices[i] - prices[i - 1]);
        }
        return profit;
    }
}

55.跳跃游戏

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

45.跳跃游戏 II

class Solution {
    public int jump(int[] nums) {
        if (nums.length == 1) return 0;
        int curCover = 0;
        int nextCover = 0;
        int ans = 0;
        for (int i = 0; i < nums.length; i++) {
            nextCover = Math.max(nextCover, i + nums[i]);
            if (nextCover >= nums.length - 1) {
                ans++;
                break;
            }
            if (i == curCover) {
                ans++;
                curCover = nextCover;
            }
        }
        return ans;
    }
}