Update Lesson on Dynamic min/max

This commit is contained in:
Jacob Delgado 2023-06-27 01:46:40 -07:00
parent ad4165f35e
commit 07a918bcb0

View File

@ -14,4 +14,18 @@ shifted_negative = my_list[2:] + my_list[:2]
print(shifted_negative) # Output: [3, 4, 5, 1, 2]
```
-
## Dynamically Updating a value in a Single Pass
```
# Code with faster Implementation
min_price = prices[0] # Track the minimum price seen so far
max_profit = 0 # Track the maximum profit
for price in prices:
# print(f'price is {price}')
# print(f'MinPrice: {min_price} or {price}')
# print(f'MaxProfit: {max_profit} or [{price} - {min_price} = {max(max_profit, price - min_price)}]')
min_price = min(min_price, price) # Update the minimum price
max_profit = max(max_profit, price - min_price) # Update the maximum profit
return max_profit
```