salary maximum profit
input..1 11 13 21 91
class MaximumProfitFinder:
def maximumProfit(self, list, fees):
def cost(i, n, prev):
if i >= n:
return 0
elif prev == True:
return max(cost(i+1, n, False) + prices[i] - fees, cost(i + 1, n, prev))
else:
return max(cost(i+1, n, True) - prices[i], cost(i + 1, n, prev))
return cost(0, len(prices), False)
profit = MaximumProfitFinder()
prices = [1, 11, 13, 21, 91]
print(profit.maximumProfit(prices, fees=15))
Comments
Leave a comment