LeetCode 122. Best Time to Buy and Sell Stock II--求股票的最大收益，交易次数不限

二十六画生的博客

已于 2022-04-17 19:35:37 修改

阅读量426

点赞数

于 2017-08-23 17:00:19 首次发布

本文链接：https://blog.youkuaiyun.com/u010002184/article/details/77508239

版权

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了LeetCode第122题的解决方案，题目要求在给定的一组股票价格中找到能实现的最大利润，交易次数不受限制。通过讨论不同策略，展示了如何确定最佳买卖时机以最大化收益。

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

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

Find and return the maximum profit you can achieve.

Example 1:

Input: prices = [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 =