121. Best Time to Buy and Sell Stock

baibaibai66

于 2016-09-09 17:37:44 发布

阅读量205

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/baibaibai66/article/details/52489436

Leetcode 专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种寻找股票交易中最大利润的算法。该算法通过一次遍历价格数组，跟踪最低买入价格及最大利润，最终得出最佳买卖时机，实现最大盈利。

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

Problem

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.

Solution

思路简单到不行，但是…脑子好累，做不动了…

保存三个值：

当前元素之前的最小值；
当前最小利润（局部最优）；
全局最优

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();

        if (n == 0) {
            return 0;
        }

        int minX = prices[0], p = 0, maxP = 0;
        for (int i = 1; i < n; ++i) {
            if (minX < prices[i]) {
                p = prices[i] - minX;
                maxP = max(maxP, p);
            }
            else {
                minX = prices[i];
            }
        }

        return maxP;
    }
};

runtime: 9ms