问题描述:
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.
给一个数组,其中第i个元素是第i天的股票价格
若只允许你至多做一次交易,即买进一次卖出一次,设计算法找到最大的利润
问题解决:
暴力的做法复杂度是O(n^2),即两层循环扫描,找到前面的数减后面的数的最小的结果,乘-1就是结果了
然而题目测例设置了个大坑,会超时
比较好的做法就是动态规划了,只需要扫描一遍数组,复杂度为O(n)
需要设置两个变量local和global,一个表示在当前一天卖出的最佳交易,另一个表示到目前为止最好的交易
递推式如下:
local[i+1] = max(local[i] + prices[i+1]-prices[i], 0)
global[i+1] = max(global[i],local[i+1])
最后得到的global就是最大的利润
代码如下:
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.size() == 0) return 0;
vector<int>::iterator iter1 = prices.begin();
int local = 0;
int global = 0;
for(; iter1 != prices.end()-1; iter1++) {
local = max(local + *(iter1+1)-*iter1, 0);
global = max(local, global);
}
return global;
}
};