Leetcode练习－Best Time to Buy and Sell Stock II

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

Flyinocean

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

阅读量391

点赞数

CC 4.0 BY-SA版权

文章标签： L leetcode Best time to buy and

本文链接：https://blog.youkuaiyun.com/Flyinocean/article/details/38632619

本文介绍了一种算法，用于计算股票交易的最大利润。该算法允许进行多次买卖操作，但每次交易必须独立完成。通过遍历价格列表，只要后一天的价格高于前一天，就进行买卖并累积利润。

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

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

核心是：唯利是图。因为可以多次交易，只要有价格差（还是只有后期价格大于前期），就可以交易，就可以积累利润。所以遍历价格list，只有后面的价格比前面的高，就可以有利润。如果没有前面高，那么不交易就行，利润当个时间段为0

class Solution:
    # @param prices, a list of integer
    # @return an integer
    def maxProfit(self, prices):
        profit = 0
        for i in xrange(1, len(prices)):
            if prices[i] > prices[i-1] :
                profit += prices[i] - prices[i-1]
        return profit