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).
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
A graph stream explanation, Valley buy, peak toss.
1 /**2 * @param {number[]} prices3 * @return {number}4 */5 varMaxprofit =function(prices) {6 varMin =Infinity;7 varmax =-Infinity;8 varres = 0;9 for(vari = 0; i < prices.length; i++){Ten if(!isfinite (max) && Prices[i] <min) { OneMin =Prices[i]; A}Else if(Isfinite (min) && prices[i] >=max) { -Max =Prices[i]; -}Else if(Isfinite (min) && Prices[i] <max) { theRes + = max-min; -Min =Prices[i]; -max =-Infinity; - } + } - if(Max >min) { +Res + = max-min; A } at returnRes; -};
[Leetcode][javascript]best time to Buy and Sell Stock II