LeetCode-Best Time to Buy and Sell Stock

最新推荐文章于 2022-07-03 21:43:22 发布

原创最新推荐文章于 2022-07-03 21:43:22 发布 · 245 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Best Time to Buy and

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Math Game

50 篇文章

订阅专栏

本文介绍了一种用于计算股票交易中最大可能利润的算法。该算法仅允许进行一次买入和一次卖出操作，并通过跟踪最低购买价格来确定最佳卖出时机。

摘要生成于 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.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int maxProfit(vector<int> &prices) {
        const int length = prices.size();
        if (length < 2) return 0;
        int lowest = prices[0];
        int result = 0;
        for (int i = 1; i < length; ++i) {
            lowest = min(lowest, prices[i]);
            result = max(result, prices[i]-lowest);
        }
        return result;
    }
};</span>