121. Best Time to Buy and Sell Stock

最新推荐文章于 2024-01-20 11:33:56 发布

原创最新推荐文章于 2024-01-20 11:33:56 发布 · 209 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种寻找股票交易中最大利润的算法。该算法针对单一买入和卖出操作，通过遍历价格数组来确定最佳购买时间和销售时间，从而获得最大收益。文章提供了具体的实现代码示例。

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.

Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

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