题目
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.
思路
运用动态规划。 从前面往后扫。关系式为 d[i]=MAX(prices[i]-prices[i-1]),(prices[i]-prices[i-1]+d[i-1]))。即 三个点,a,b,c。d[i]=MAX(c-b,c-a). 然后d[i]与max比较,获得 MAX(c-b,c-a,b-a)
代码
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.size()<=1) {
return 0;
}
int* d=new int[prices.size()];
d[1]=prices[1]-prices[0];
int max=d[1];
for(int i=2;i<prices.size();i++) {
d[i]=(prices[i]-prices[i-1])>(prices[i]-prices[i-1]+d[i-1])?prices[i]-prices[i-1]:prices[i]-prices[i-1]+d[i-1];
if(d[i]>max) {
max=d[i];
}
}
if(max>0) {
return max;
}
else {
return 0;
}
}
};