ImAlpha/LeetCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Complete, Beats 11% runtime, beats 42% memory

Browse Source
This commit is contained in:
Jacob Delgado 2023-06-30 22:29:51 -07:00
parent f2ae3fd549
commit 2a6b73a842
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
Top150Interview/122BestTimetoBuyandSellStock2.py
View File

@ -3,17 +3,17 @@ def maxProfit(prices):
:type prices: List[int] :type prices: List[int]
:rtype: int :rtype: int
""" """
lowest = min(prices) profit = 0
if lowest == prices[len(prices)-1]:
print('no profit')
return 0
for i in range(len(prices)): for i in range(len(prices)):
if lowest == prices[i]: # print(i)
k = i+1 if i+1 == len(prices):
# print(f'k is {k}') break
profit = max(prices[k:]) - lowest if prices[i] < prices[i+1]:
print(profit) # print(i)
return profit # print('hit')
profit += prices[i+1] - prices[i]
# print(profit)
return profit
maxProfit([7,1,5,3,6,4]) maxProfit([7,1,5,3,6,4])
# maxProfit([7,6,4,3,1]) # maxProfit([7,6,4,3,1])