Seawolf 发表于 2020-9-10 22:53:53

Leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee

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 = , fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
Buying at prices = 1
Selling at prices = 8
Buying at prices = 4
Selling at prices = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
Note:

0 < prices.length <= 50000.
0 < prices < 50000.
0 <= fee < 50000.

class Solution:
    def maxProfit(self, prices: List, fee: int) -> int:
      hold, sold = -math.inf, 0
      
      for price in prices:
            hold_tmp, sold_tmp = hold, sold
            
            hold = max(hold_tmp, sold_tmp - price)
            sold = max(sold_tmp, hold_tmp + price - fee)
      
      return max(hold, sold)
页: [1]
查看完整版本: Leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee