Leetcode:best time to Buy and Sell Stock II

Topic:
Say you had an array for which the ith element was 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).

Thinking Analysis:
The question "Leetcode:best time to Buy and Sell Stock" is similar. But this time there is no limit to the number of trades, so we buy and sell each time we make a profit.

C + + Reference code:

classsolution{ Public:intMaxprofit ( vector<int>&prices) { vector<int>:: Size_type size = Prices.size ();if(0= = size)return 0;intresult =0; for(inti =1; i < size; ++i) {if(Prices[i]-prices[i-1] >0) result + = Prices[i]-prices[i-1]; }returnResult }};

C # Reference Code:

 Public classsolution{ Public int Maxprofit(int[] prices) {if(Prices. Length = =0)return 0;intresult =0; for(inti =1; I < prices. Length; ++i) {if(Prices[i]-prices[i-1] >0) result + = Prices[i]-prices[i-1]; }returnResult }}

Leetcode:best time to Buy and Sell Stock II