Skip to content

Commit 90471bb

Browse files
Update 121. Best Time to Buy and Sell Stock.py
1 parent 5c360b0 commit 90471bb

File tree

1 file changed

+14
-8
lines changed

1 file changed

+14
-8
lines changed
Lines changed: 14 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,20 @@
11
class Solution:
22
def maxProfit(self, prices: List[int]) -> int:
3-
min_price = prices[0]
4-
max_price = prices[0]
3+
"""
4+
maxProfit returns difference in prices[i] where maximum profit can be obtained
5+
returns 0 if no profit can be made
6+
prices array (1 <= prices.length <= 105), (0 <= prices[i] <= 104)
7+
list of prices on consecutive days
8+
"""
9+
min_price = prices[0] #set min_price to 1st value in prices
10+
max_price = prices[0] #set max_price ot 1st value in prices
511
diff_price = 0
6-
for price in prices:
7-
if price < min_price:
8-
min_price = price
9-
max_price = price
12+
for price in prices:
13+
if price < min_price: #iterate through prices
14+
min_price = price #assign lowest value in prices to min_price
15+
max_price = price #assign lowest value in prices to max_price
1016
elif price > max_price:
11-
max_price = price
17+
max_price = price #assign highest value in prices to max_price
1218
if diff_price < max_price - min_price:
13-
diff_price = max_price - min_price
19+
diff_price = max_price - min_price #calculate diff_price
1420
return diff_price

0 commit comments

Comments
 (0)