!!!!! 122. Best time to Buy and Sell Stock II

Say you has an array for which the i-th element is the price of a given-stock on day I.

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

=======================

Stock Trading Issues II

Topic: Unlike I, the place is, can do as much as possible trading,

This time you can buy a stock, sell a stock several times, but you can't make multiple trades at the same time,

That means you have to sell all the shares before you buy the stock.

[]

=========

Code

classSolution {//this time you can buy a stock, sell a stock several times, but you can't make multiple trades at the same time,//That means you have to sell all the stocks before you buy the stock . Public:    intMaxprofit (vector<int>&prices) {        //An example [5,1,4,5,3,4,5]//[0,3,1,0,1,1]//J means all the opportunities to make money, you can catch it.//Instead of only making one trade, only earning 5-1=4        intLength =prices.size (); intTotal =0;  for(inti =1; i<length;i++){            if(prices[i]>prices[i-1]) { total+ = prices[i]-prices[i-1]; }        }//        returnTotal ; }};

!!!!! 122. Best time to Buy and Sell Stock II