// algorigthm 的 min 和 max 函数用于保存当前状态
#include <algorithm>
#include <vector>
using namespace std;
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.empty())
return 0;
int profit = 0;
int buy = prices[0];
for(int i=0;i<prices.size();i++){
//截至到第i天的时候,买入的最低
buy = min(buy,prices[i]);
profit = max(profit,prices[i] - buy);
}
return profit;
}
};
03-29
230