题目
贪心法从左到右更新最大利润
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.empty())return 0;
int maxv = 0;
for(int i = 1,minv = prices[0];i<prices.size();i++)
{
maxv = max(maxv,prices[i]-minv);
minv = min(minv,prices[i]);
}
return maxv;
}
};