Skip to content

Update Best Time to Buy and Sell Stock - Leetcode 121.py #36

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Best Time to Buy and Sell Stock - Leetcode 121.py #36

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions ...me to Buy and Sell Stock - Leetcode 121/Best Time to Buy and Sell Stock - Leetcode 121.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -48,3 +48,19 @@ def maxProfit(self, prices: List[int]) -> int:
max_profit = max(profit, max_profit)

return max_profit

# Takes account of 1st day
class Solution:
def maxProfit(self, prices: List[int]) -> int:
min_price = prices[0] # Day1 and we can't go back in time
max_profit = 0

for price in prices:
if price < min_price: #e.g 7 =7, 7 >1
min_price = price
else:
current_profit = price - min_price # then: cp = 7 - 7:0; 7 - 1: 6
if current_profit > max_profit: # 6>0
max_profit = current_profit

return max_profit # 6