LeetCode --- 122. Best Time to Buy and Sell Stock II 解题报告

最新推荐文章于 2025-03-05 19:31:48 发布

杨鑫newlfe

最新推荐文章于 2025-03-05 19:31:48 发布

阅读量275

点赞数

分类专栏： Python 算法 LeetCode 文章标签： Python LeetCode 算法 ACM Best Time to Buy and Sell Stoc

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/95318325

版权

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

这篇博客详细介绍了LeetCode中的第122题，即寻找最佳买卖股票时机II的问题。通过讨论不同的策略，文章解释了如何在允许多次交易的情况下最大化利润。示例展示了不同情况下的交易过程，帮助读者理解算法的实施和思路。

摘要生成于 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 (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.

了解本专栏