1、题目
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/
2、题意
题解1:维护最小买入的价格 更新结果的最大值
class Solution {
public:
int maxProfit(vector<int>& prices) {
int res = 0,start = INT_MAX;
for(int i =0;i<prices.size();i++)
{
start = min(prices[i],start);
res = max(res,prices[i]-start);
}
return res;
}
};