day32 贪心.p2

- 122.买卖股票的最佳时机II 
```cpp
class Solution {

public:

    int maxProfit(vector<int>& prices) {

        int result = 0;

        for (int i = 1; i < prices.size(); i++) {

            int profit = prices[i] - prices[i - 1];

            if (profit > 0) result += profit;

        }

        return result;

    }

};
```
- 55. 跳跃游戏 
```cpp
class Solution {

public:

    bool canJump(vector<int>& nums) {

        int coverLen = 0;

        for (int i = 0; i <= coverLen; i++) {

            coverLen = i + nums[i] > coverLen ? i + nums[i] : coverLen;

            if (coverLen >= nums.size() - 1) return true;

        }

        return false;

    }

};
```
- 45.跳跃游戏II
```cpp
class Solution {

public:

    int jump(vector<int>& nums) {

        int curDis = 0, nextDis = 0, result = 0;

        for (int i = 0; i < nums.size() - 1; i++) {

            nextDis = max(nextDis, nums[i] + i);

            if (i == curDis) {

                curDis = nextDis;

                result++;

            }

        }

        return result;

    }

};
```