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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Example 1:
Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.
思路:
两种方案:1 暴力搜索;2 两个指针
1 暴力搜索
int maxProfit(vector<int>& prices) {
if (prices.size() <= 1) return 0;
int maxPro = 0;
for (int i = 0; i < prices.size()-1; i++){
for (int j = i+1; j < prices.size(); j++){
maxPro = max(maxPro, prices[j] - prices[i]);
}
}
return maxPro;
}
2 两个指针
两个指针的作用是维持一个窗口,在这个窗口中,prices[right]>prices[left],这样我们就可以使我们的利润一直是记录的增长的值。
int maxProfit2(vector<int>& prices){
if (prices.size() <= 1) return 0;
int maxPro = 0, left = 0, right = 1;
while (right < prices.size()){
if (prices[right] <= prices[left]){
left = right;
right++;
}
else{
maxPro = max(maxPro, prices[right] - prices[left]);
right++;
}
}
return maxPro;
}