代码随想录训练营第三十一天 ｜ 贪心算法

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

class Solution {
    public boolean canJump(int[] nums) {

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

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

            if(i == end){
                end = temp;
                res++;
            }

        }
        return res;
    }
}