以下是第一种做法的 Python 代码:
def max_profit(prices):
n = len(prices)
if n < 2:
return 0
# 分别计算前i天的最大收益,以及前i天的最小价格
max_profits =[0] * n
min_prices = [0] * n
min_prices[0] = prices[0]
for i in range(1, n):
min_prices[i] = min(min_prices[i - 1], prices[i])
max_profits[i] = max(max_profits[i - 1], prices[i] - min_prices[i])
# 分别计算后i天的最大收益,以及后i天的最大价格
reverse_max_profits = [0] * n
max_prices = [0] * n
max_prices[-1] = prices[-1]
for i in range(n - 2, -1, -1):
max_prices[i] = max(max_prices[i + 1], prices[i])
reverse_max_profits[i] = max(reverse_max_profits[i + 1], max_prices[i] - prices[i])
# 最大收益就是两次交易的最大收益之和
max_profit = 0
for i in range(n):
max_profit = max(max_profit, max_profits[i] + reverse_max_profits[i])
return max_profit