Best Time to Buy and Sell Stock with Transaction Fee

最新推荐文章于 2023-12-04 07:36:04 发布

weixin_36908057

最新推荐文章于 2023-12-04 07:36:04 发布

阅读量250

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/weixin_36908057/article/details/78525847

leetcode 专栏收录该内容

46 篇文章

订阅专栏

本文探讨了在给定股票价格序列及交易费的条件下如何通过最优买卖策略实现最大利润的问题。文章提供了一个示例，展示了如何通过精确选择买入卖出时机来最大化收益。

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

Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
Return the maximum profit you can make.
Example 1:
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
Buying at prices[0] = 1
Selling at prices[3] = 8
Buying at prices[4] = 4
Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.

Note:
0 < prices.length <= 50000.
0 < prices[i] < 50000.
0 <= fee < 50000.

https://discuss.leetcode.com/topic/107998/most-consistent-ways-of-dealing-with-the-series-of-stock-problems