题目:
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.
代码:
方法一——暴力搜索:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int len=prices.size();
if(len<=1)return 0;
int max=0;
for(int i=0;i<len-1;i++){
for(int j=i+1;j<len;j++){
int v=prices[j]-prices[i];
if(v>max){max=v;}
}
}
return max;
}
};
方法二——分情况法:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int len = prices.size();
if (len <= 1)return 0;
int left = prices[0], right = prices[len - 1];
int m = right - left;
for (int i = 1; i < len; i++) {
if (prices[i] < left) {
left = prices[i];
m = max(m, right - left);
}
else if (prices[i] > right) {
m = max(m, prices[i] - left);
}
}
return m;
}
};
想法:
考虑多种情况