Best Time to Buy and Sell Stock II

1，题目要求

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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:
Input:[7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:
Input:[1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
engaging multiple transactions at the same time. You must sell before buying again.

Example 3:
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

假设您有一个数组，其中第i个元素是第i天给定股票的价格。

设计算法以找到最大利润。 您可以根据需要完成尽可能多的交易（即，多次买入并卖出一股股票）。

注意：您不得同时进行多笔交易（即，您必须在再次购买之前卖出股票）。

2，题目思路

对于这道题，求买卖股票可以获得的最大利润（可以一天采取多笔交易）。

在之前，我们就已经做过类似的题目要了：
Best Time to Buy and Sell Stock
上道题与目前这道题的不同之处在于，这道题一天可以采取多次买卖股票的操作，而上道题一天要么买要么卖，因此需要使用动态规划的策略。

这道题，我们因为已经知道了每天的价格，因此，就不用考虑太多，只需要股票一涨价，就将其卖掉。如果下一个时间还涨，就买回来再在下个时间卖掉即可。

3，代码实现

static auto speedup = [](){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();

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