Complete, Beats 11% runtime, beats 42% memory
This commit is contained in:
parent
f2ae3fd549
commit
2a6b73a842
@ -3,17 +3,17 @@ def maxProfit(prices):
|
||||
:type prices: List[int]
|
||||
:rtype: int
|
||||
"""
|
||||
lowest = min(prices)
|
||||
if lowest == prices[len(prices)-1]:
|
||||
print('no profit')
|
||||
return 0
|
||||
profit = 0
|
||||
for i in range(len(prices)):
|
||||
if lowest == prices[i]:
|
||||
k = i+1
|
||||
# print(f'k is {k}')
|
||||
profit = max(prices[k:]) - lowest
|
||||
print(profit)
|
||||
return profit
|
||||
# print(i)
|
||||
if i+1 == len(prices):
|
||||
break
|
||||
if prices[i] < prices[i+1]:
|
||||
# print(i)
|
||||
# print('hit')
|
||||
profit += prices[i+1] - prices[i]
|
||||
# print(profit)
|
||||
return profit
|
||||
|
||||
maxProfit([7,1,5,3,6,4])
|
||||
# maxProfit([7,6,4,3,1])
|
||||
Loading…
Reference in New Issue
Block a user