122. Best Time to Buy and Sell Stock II

int maxProfit(vector<int> &prices) {
    int ret = 0;
    for (size_t p = 1; p < prices.size(); ++p) 
      ret += max(prices[p] - prices[p - 1], 0);    
    return ret;
}

/*class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int min;
        int max;
        int sum=0;
        int i=0;
        while(i<prices.size())
        {
            while(i<prices.size())
            {
                if(i+1==prices.size())
                {
                    min=prices[i];
                    break;
                }
                if(prices[i]<prices[i+1])
                {
                    min=prices[i++];
                    break;
                }
                i++;
            }
            while(i<prices.size())
            {
                if(i+1==prices.size())
                {
                    max=prices[i++];
                    break;
                }
                if(prices[i]>prices[i+1])
                {
                    max=prices[i++];
                    break;
                }
                i++;
            }
            sum+=max-min;
        }
        return sum;
    }
};*/