目录
1.买卖股票的最佳时机

这道题通过贪心算法解决,我们通过保存最低的买入价格来计算利润
cpp
class Solution {
public:
int maxProfit(vector<int>& prices) {
int minprices = prices[0];
int gain = 0;
for(int i = 0; i < prices.size(); i++)
{
gain = max(gain, prices[i] - minprices);
minprices = min(minprices, prices[i]);
}
return gain;
}
};