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.
如果直接用两次迭代,会超时,倒序输入时,会很慢。
DP问题
class Solution {
public:
int maxProfit(vector<int> &prices) {
int maxPro = 0;
int minPrice = INT_MAX;
for(int i = 0; i < prices.size(); i++){
minPrice = min(minPrice, prices[i]);
maxPro = max(maxPro, prices[i] - minPrice);
}
return maxPro;
}
};
minPrice is the minimum price from day 0 to day i. And maxPro is the maximum profit we can get from day 0 to day i.
How to get maxPro? Just get the larger one between current maxPro and prices[i] - minPrice.
第二种
class Solution {
public:
int maxProfit(vector<int> &prices) {
int maxCur = 0, maxSoFar = 0;
for(int i = 1; i < prices.size(); i++) {
maxCur = max(0, maxCur += prices[i] - prices[i-1]);
maxSoFar = max(maxCur, maxSoFar);
}
return maxSoFar;
}
};