day32

122

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res = 0;
        if(prices.size() <= 1) return 0;
        for(int i = 0; i < prices.size() - 1; i++){
            auto j = prices[i + 1] - prices[i];
            if(j > 0){
                res += j;
            }
        }
        return res;

    }
};

55

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int k = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (i > k) return false;
            k = max(k, i + nums[i]);
        }
        return true;
    }
};

45

class Solution {
public:
    int jump(vector<int>& nums) {
        
        int steps = 0;
        int begin = 0;
        int end = 1;
        while(end < nums.size()){
            int k = 0;
            for (int i = begin; i < end; i++) {
                k = max(k, i + nums[i]);
            }
            begin = end;
            end = k + 1;
            steps++;
        }
        return steps;
    
    }
};