LeetCode - 122. Best Time to Buy and Sell Stock II - 思路詳解 - C++

題目

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).

翻譯

假設你有一個數組，第i個元素表示第i天的股票價格
設計一個算法，計算出可以獲得的最大收益。你可以進行儘可能多次的交易。但是，你不可以在同一時間進行多次交易。及必須在賣之前先買入。

思路

該題目是一道貪心的題目；
即將所有上升階段的收益累計即可。

代碼

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