[leetcode] 121. Best Time to Buy and Sell Stock

最新推荐文章于 2025-09-11 19:19:55 发布

denny851108

最新推荐文章于 2025-09-11 19:19:55 发布

阅读量189

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode easy

本文链接：https://blog.youkuaiyun.com/denny851108/article/details/51577057

leetcode 专栏收录该内容

179 篇文章

订阅专栏

本文介绍了一种寻找股票买卖最佳时机以获得最大利润的算法。该算法通过记录当前最低价格并计算潜在利润来确定最佳买卖点，从而实现最大收益。

Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Solution

Idea: record current minimum price, and calculate the current profit. If the current profit is large than previous max profit, update max profit.

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (!prices.size()) return 0;
        int ret = 0;
        int minp = prices[0];
        for(int i =0; i < prices.size(); i++){
            minp = min(minp,prices[i]);
            ret = max(ret, prices[i] - minp);
        }
        return ret;
        
        
    }
};