题目连接:Leetcode 121 Best Time to Buy and Sell Stock
解题思路:遍历过程中,维护当前碰到的最小值,并用当前值减去目前的最小值,维护最大收益。
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) return 0;
int ans = 0, bot = prices[0];
for (int i = 1; i < prices.size(); i++) {
ans = max(ans, prices[i] - bot);
bot = min(bot, prices[i]);
}
return ans;
}
};