题目:
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.
class Solution {
public:
//DP
//只做一笔交易取得最大值
//如何在第0...i天获得最大利润?肯定是历史最低价买进,那什么时候卖出呢?
//每天有两种选择:卖或不卖
//当天卖能取得最大利润是:当天价格减去历史最低价
//当天不卖能取得最大利润是:前一天能取得的最大利润
//当天能取得的最大利润是以上两者中的最大值
int maxProfit(vector<int>& prices) {
if (prices.empty()) return 0;
int *tbl = new int[prices.size()];//tbl[i]表示第i天可以取得的最大利润
int min = prices[0];//min表示i之前的最小值
tbl[0] = 0;
for (int i = 1; i < prices.size(); ++i){
if (prices[i] < min) min = prices[i];//如果当天价格比历史最低价低,则更新历史最低价
//如果当天价格减去历史最低价(当天卖出)取得的利润比前一天取得最大利润大,则当天卖出;否则当天不卖出(在当天之前卖出)
tbl[i] = prices[i] - min > tbl[i - 1] ? prices[i] - min : tbl[i - 1];
}
int res = tbl[prices.size() - 1];
delete[]tbl;
return res;
}
};