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:
Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0
In this case, no transaction is done, i.e. max profit = 0.
思路:最小值是一直可以保留的,最大值呢,每次ai > ai-1的时候,就进行跟最小值计算,然后用个变量保留全局最大就可以了。
class Solution {
public int maxProfit(int[] prices) {
if(prices == null || prices.length == 0) {
return 0;
}
int curmin = prices[0];
int profit = 0;
for(int i = 1; i < prices.length; i++) {
if(prices[i] - curmin > profit) {
profit = prices[i] - curmin;
}
curmin = Math.min(curmin, prices[i]);
}
return profit;
}
}