[LeetCode OJ]Best Time to Buy and Sell Stock

最新推荐文章于 2019-05-01 17:57:00 发布

原创最新推荐文章于 2019-05-01 17:57:00 发布 · 464 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一种寻找股票买卖最佳时机以实现最大利润的算法。该算法通过一次遍历即可确定何时买入和卖出股票，以获得最高收益。两种不同的实现方式被提出，一种从前向后遍历价格记录，另一种则从后向前遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        if (prices.size() == 0)
            return 0;
            
        int maxPrice = prices[prices.size()-1];
        int ans = 0;
        for(int i = prices.size() - 1; i >= 0; i--)
        {
            maxPrice = max(maxPrice, prices[i]);
            ans = max(ans, maxPrice - prices[i]);
        }
        
        return ans;
    }
};