Best_Time_to_Buy_and_Sell_Stock_II.cpp

#include <vector>
#include <algorithm>

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