问题描述:
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.
问题分析:
本题主要是求解数组中两个元素最大差值,可根据动态最小元素值求解两元素间最大差值。
过程详见代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.empty()) return 0;
int ma = 0;
int mi = prices[0];
for(int i = 1; i < prices.size(); i++)
{
if(prices[i] > mi)
{
ma = max(prices[i] - mi,ma);
}
else mi = prices[i];
}
return ma;
}
};