小黑代码（独立做出） class Solution:def maxProfit(self, prices: List[int], fee: int) -> int:# 数组长度n = len(prices)if n < 2:return 0# 动态规划变量buy = -prices[0]sell = 0for i in range(1, n):buy = max(buy, sell-prices