Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 122. Best Time to Buy and Sell Stock II

---

題目：


解答：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int max_profit = 0;

        for (int i = 1; i < prices.size(); ++i) {
            if (prices[i] > prices[i - 1]) {
                max_profit += prices[i] - prices[i - 1];
            }
        }

        return max_profit;
    }
};