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.
- lowest：当前prices最小值
- maxProfit：当前profit最大值
public int maxProfit(int[] prices) {
if (prices.length <= 1) {
return 0;
}
int maxProfit = 0;
int lowest = Integer.MAX_VALUE;
for (int v : prices) {
lowest = Math.min(v, lowest);
maxProfit = Math.max(maxProfit, v - lowest);
}
return maxProfit;
}
