LeetCode 122. Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II

---

题目描述:

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

---

题目大意:

之前是可以买一次，找出差值最大的两个数即可（小的必须在前面）。现在可以买多次，但是每次买之前如果已经买了，就需要先卖掉之前买的。只要求出所有的连续上升子序列的极值差的和就是答案。这里有一个技巧，只要后一个数比前一个数大，我们就加上他们的差值，最后差值的总和就是所有连续上升子序列的极差的和。

例如：1 2 100
(2-1)+(100-2) = (100-1)
其实就是以1价格买入，以2价格卖出，再以2价格买入，以100价格卖出。其中以2价格卖出，再以2价格买入，这两个操作时互相“抵消”的。因此和以1价格买入，以100价格卖出是一样的。

---

题目代码:

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