Best Time to Buy and Sell Stock

最新推荐文章于 2022-07-29 20:36:59 发布

dbu50120

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量86

点赞数

原文链接：http://www.cnblogs.com/yeek/p/3578134.html

版权

本文介绍了一种算法，用于在给定股票价格数组的情况下，找到完成最多一次交易可能获得的最大利润。通过遍历价格数组，算法跟踪最低购买价格和当前最大利润，最终返回最大可能利润。

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

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.

Solution:

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