[Leetcode] best time to Buy and Sell Stock

Say you has an array for which the i-th element is the price of a given-stock on day I.

If you were-permitted-to-complete at most one transaction (ie, buy one and sell one share of the stock), design an AL Gorithm to find the maximum profit.

Invariant is that if day I and J days are the highest-yielding buy and sell points respectively, then prices[i] must be the lowest price in the range [0, J].

Use traversal only once to calculate the profit with the lowest price currently found, and update the maximum value of the profit, while updating the lowest price. Results are obtained after the traversal is complete.

/**/varfunction(prices    ) {var n = 0;     var lowest = prices[0];    Prices.foreach (function(p) {        = Math.max (n, p- lowest);         = math.min (lowest, p);    });     return N;};

[Leetcode] best time to Buy and Sell Stock