#714

Best Time to Buy and Sell Stock with Transaction Fee

pupil · 535 · lc medium +28 · verified · 71.7% accepted · 7,607 likes · top 81%

Description

You are given an integer array prices where prices[i] is the stock price on day i, and an integer fee that is charged once per completed buy-sell transaction. You may buy and sell any number of times, but you cannot hold two positions at once.

Return the maximum profit achievable after paying all transaction fees.

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.

Example 2:

Input: prices = [1,3,7,5,10,3], fee = 3

Output: 6

Code

1

2

3

class Solution:
    def maxProfit(self, prices: List[int], fee: int) -> int:

class Solution:
    def maxProfit(self, prices: List[int], fee: int) -> int: