用时15分钟。
题目链接
https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/
解题思路
- 滑动窗口(?)
- 设置min为最低价格,设置maxprofit为当前价格与最低价格之间的差价;
- 求最大差价
代码
class Solution {
public:
int maxProfit(vector<int>& prices) {
int min = INT_MAX;
int maxprofit = 0;
for(int i = 0; i < prices.size(); ++i)
{
if(prices[i] < min)
min = prices[i];
else if(maxprofit < prices[i] - min)
maxprofit = prices[i] - min;
}
return maxprofit;
}
};