LeetCode26贪心02

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

力扣题目链接

class Solution {
    public int maxProfit(int[] prices) {
        int result = 0;
        if(prices.length == 1)return result;
        for(int i = 0;i < prices.length - 1;i++){
            if(prices[i + 1] > prices[i])result +=(prices[i + 1] - prices[i]);
        }
        return result;
    }
}

55. 跳跃游戏

力扣题目链接

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

45.跳跃游戏II

力扣题目链接

class Solution {
    public int jump(int[] nums) {
        int curDistance = 0;
        int nextDistance = 0;
        int sum = 0;
        for(int i = 0;i < nums.length;i++){
            nextDistance = Math.max(i + nums[i],nextDistance);
            if(i == curDistance){
                if(curDistance < nums.length - 1){
                    sum++;
                    curDistance = nextDistance;
                    if(nextDistance > nums.length)break;
                } else break;//当前已经超过了，break。可以解决数组长度为1的情况
            }
           
        }
        return sum;
    }
}