Leetcode – Best Time to Buy and Sell Stock (Java)

Tags: ,

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

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

Example 1:

Example 2:

 
Analysis:
 
We scan the table, and record the minimum price in the range [0, i - 1], so the potential max profit is prices[i] - min(prices[0, i-1])
The following is the implementation in Java: