算法跟学Day32【代码随想录】

第八章 贪心算法 part02

大纲

● 122.买卖股票的最佳时机II
● 55. 跳跃游戏
● 45.跳跃游戏II

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

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

leetcode 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;
    }
}

leetcode 45跳跃游戏II

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