best time to Buy and Sell Stock Ii--leetcode

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).

The main topic: similar to the previous question, is to seek the maximum profit, the previous question requires only buy and sell once, this time can be sold many times.

Problem-solving ideas: From the 2nd day onwards, as long as the previous price must not regardless, than the previous price to sell higher than before.

     Public intMaxprofit (int[] prices) {        if(Prices = =NULL|| Prices.length = = 0) {            return0; }        intMin_pos = 0; intMax_pro = 0;  for(inti = 1; i < prices.length; i++) {            if(Prices[i] > Prices[i-1]) {Max_pro+ = Prices[i]-Prices[min_pos]; } Min_pos=i; }        returnMax_pro; }

best time to Buy and Sell Stock Ii--leetcode