LeetCode OJ: Best Time to Buy and Stock II

Best Time to Buy and Buy Stock II My Submissions

Say you have an array for which the ith element is the price of a given stock on day I.

Design an algorithm to find the maximum profit. you may complete as your transactions as you like (ie, buy one and every one share of the stock multiple times ). however, you may not engage in multiple transactions at the same time (ie, you must wait the stock before you buy again ).

Algorithm idea:

Now that you can buy and sell any number of times, and you must switch between them, you can simply add up all the profitable situations. For example, for the question stem sequence {1, 2, 3, 1}, because 2> 1, profit, so buy 1 money to sell 2 money, because 3> 2, so buy 2 money to sell 3 money, in fact, this is equivalent to the first day to buy 1 money, three more dollars will be sold on the third day. Similarly, because the loss is made on the fourth day, we will not spend three dollars to buy the shares on the third day.

Class Solution {public: int maxProfit (vector

 
  
& Prices) {int maxP = 0; for (int I = 1; I

  
   
0) maxP + = prices [I]-prices [I-1]; return maxP ;}};