Leetcode No122. best time to buy and Sell the stock Ii_leetcode

Question:

Say you have an array for which the ith element are the price of a given the

Design a algorithm to find the maximum profit. You may complete as many transactions as (ie, buy one and sell one share of the stock multiple times). However, you could not engage in multiple transactions at the same time (ie, your must sell the stock before your buy again).

An array of elements of the day's stock prices, allowing transactions many times, the maximum profit Algorithm:greedy greedy algorithm, as long as the day the price is higher than the previous days, counted into the maximum profit. Accepted Code:

Class Solution {//Transaction times Unlimited, greedy algorithm public
:
    int Maxprofit (vector<int>& prices) {
        if (prices.size () <2) return 0;
        int res=0;
        for (int i=1;i<prices.size (); i++)
            res+=prices[i]-prices[i-1]>0? ( PRICES[I]-PRICES[I-1]): 0;
        return res;
    }
;