A Easy-understand C++ Solution


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.