LeetCode 122. Best Time to Buy and Sell Stock II

Description

Say you have an array for which the $i^{th}$ element is the price of a given stock on day i <script type="math/tex" id="MathJax-Element-2">i</script>.
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).

Solution

由于题意设置可以无限次买入和卖出股票，所以只需从第二天开始，如果当前价格比之前价格高，则把差值加入利润中，即昨天买入，今日卖出，若明日价更高的话，还可以今日买入，明日再卖出。以此类推，遍历完整个数组后即可求得最大利润。

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