Skip to content

Instantly share code, notes, and snippets.

Created Mar 24, 2021
What would you like to do?
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))
return max(cost(i+1, n, True) - prices[i], cost(i + 1, n, prev))
return cost(0, len(prices), False)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment