122. Best Time to Buy and Sell Stock II

最新推荐文章于 2024-01-03 12:56:44 发布

原创最新推荐文章于 2024-01-03 12:56:44 发布 · 230 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode(Go) 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格序列中的最大可能利润。允许进行多次买卖交易，但不能同时持有多个股票。通过示例展示了如何在不同价格波动情况下获得最大收益。

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

Say you have an array for which the i^th 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

func maxProfit(prices []int) int {
    ret := 0
    for i,_ := range prices {
        if i>0 && prices[i] > prices[i-1] {
            ret += prices[i] - prices[i-1]
        }
    }
    return ret
}

* i>0 ,otherwise runtime error.