Leetcode 121. Best Time to Buy and Sell Stock

最新推荐文章于 2024-10-05 12:29:44 发布

努力翻身的臭咸鱼

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量118

点赞数

分类专栏：用法总结文章标签： leetcode

本文链接：https://blog.csdn.net/ytwang95/article/details/81902950

版权

用法总结专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.

题目分析：

找到最大利润值，即第i天买入第j天卖出（j>i）。只需要记录当前最大利润和最小价格，每次向后遍历，看与最小价格的差是否比最大利润大，再比较当前价格是否比最小价格小。如此遍历一次就能得到最大利润。

代码如下：

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

相似题目：Leetcode 122. Best Time to Buy and Sell Stock II

Leetcode 123.Best Time to Buy and Sell Stock III