【数据结构入门_数组】 Leetcode 121. 买卖股票的最佳时机

最新推荐文章于 2022-07-31 10:31:57 发布

cwtnice

最新推荐文章于 2022-07-31 10:31:57 发布

阅读量131

点赞数

分类专栏：每日一题文章标签： leetcode

本文链接：https://blog.csdn.net/cwtnice/article/details/125430611

版权

每日一题专栏收录该内容

118 篇文章 2 订阅

订阅专栏

原题链接：Leetcode 121. Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [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.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

Constraints:

1 <= prices.length <= 10⁵
0 <= prices[i] <= 10⁴

方法一：模拟

思路：

遍历一遍数组，维护最低价格和最大利润

c++代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int minprice = INT_MAX, maxProfit = 0;
        // 遍历的同时更新最低价格和最大利润
        for(auto price : prices){
            minprice = min(price, minprice);
            maxProfit = max(price - minprice, maxProfit);
        }
        return maxProfit;
    }
};