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:
int maxProfit(vector<int> &prices) {
if(prices.size()<2)
return 0;
int mi=prices[0];
int profit=0;
for(int i=1;i<prices.size();i++)
{
if(prices[i]-mi>profit)
profit=prices[i]-mi;
if(prices[i]<mi)
mi=prices[i];
}
return profit;
}
};