补第十六周Leetcode算法博客

最新推荐文章于 2025-05-04 09:35:45 发布

原创最新推荐文章于 2025-05-04 09:35:45 发布 · 332 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

学习日记专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种寻找股票买卖最佳时机以获得最大利润的算法。该算法通过一次遍历记录最低买入价格，并更新最高利润。适用于LeetCode上的121题，即只允许进行一次交易的情况。

开发板推荐：天空星STM32F407VET6开发板

超高性价比 STM32主控 | 超高主频 | 一板兼容百芯 | 比赛神器 | 沉金彩色丝印

点击查看

补第十六周Leetcode算法博客

121. Best Time to Buy and Sell Stock

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) {
        int minPrice = INT_MAX;
        int MaxProfile = 0;
        for (int i = 0; i < prices.size(); i++) {
            minPrice = min(minPrice, prices[i]);
            MaxProfile = max(MaxProfile, prices[i] - minPrice);
        }
        return MaxProfile;
    }
};