LeetCode | Best time to buy and keep stock 2, leetcode=

LeetCode | Best time to buy and keep stock 2, leetcode=

Question:

Say you have 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 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 ).

Idea: create the same array as above, so this question is similar to finding the sum of positive values in an array.

Int SellStock (vector <int> & vec) {vector <int> share (vec. size (), 0); int I; for (I = 1; I <vec. size (); I ++) share [I] = vec [I]-vec [I-1]; int sum = 0; for (I =-0; I <share. size (); I ++) if (share [I]> 0) sum + = share [I]; return sum ;}