Problem Description:

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.

Solution:

1     public int maxProfit(int[] prices) { 2         if (prices.length <= 1) return 0; 3         int max = 0; 4         int low = prices[0]; 5         for (int i = 0; i < prices.length; i++){ 6             low = Math.min(low, prices[i]); 7             max = Math.max(max, prices[i] - low); 8         } 9         return max;10     }