99_leetcode_Best Time to Buy and sell Stock

最新推荐文章于 2025-04-18 22:24:21 发布

weixin_30786617

最新推荐文章于 2025-04-18 22:24:21 发布

阅读量50

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wzjhoutai/p/7141522.html

本文介绍了一种寻找股票买卖最佳时机以实现最大利润的算法。通过遍历价格数组，算法记录下每天之前出现过的最低价，并计算当前价格与最低价之差作为潜在利润，最终返回所有可能利润中的最大值。

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

1:遍历数组；2:每个数字获得该数字之前的最小的数字，并与当时保存的最大值相比較

    int maxProfit(vector<int> &prices)
    {
        if(prices.size() <= 1)
        {
            return 0;
        }
        
        int maxValue = 0;
        int minPrice = prices[0];
        int size = (int)prices.size();
        
        for(int i = 1; i < size; i++)
        {
            if(prices[i] > minPrice)
            {
                maxValue = (maxValue > prices[i] - minPrice ? maxValue : prices[i] - minPrice);
            }
            else
            {
                minPrice = prices[i];
            }
        }
        
        return maxValue;
    }

转载于:https://www.cnblogs.com/wzjhoutai/p/7141522.html