Skip to content

Commit 939d30c

Browse files
solves buy and sell stock ii in python
1 parent 9bdbfcb commit 939d30c

File tree

2 files changed

+16
-1
lines changed

2 files changed

+16
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@
3939
| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PascalsTriangle.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/pascals_triangle.py) |
4040
| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PascalsTriangleII.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/pascals_triangle_ii.py) |
4141
| 121 | [Best Time to Buy and Sell Stocks](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/BestTimeToBuyAndSellStock.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/best_time_to_buy_and_sell_stock.py) |
42-
| 122 | [Best Time to Buy and Sell Stocks II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/BestTimeToBuyAndSellStockII.java) |
42+
| 122 | [Best Time to Buy and Sell Stocks II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/BestTimeToBuyAndSellStockII.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/best_time_to_buy_and_sell_stock_ii.py) |
4343
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidPalindrome.java) |
4444
| 136 | [Single Number](https://leetcode.com/problems/single-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/SingleNumber.java) |
4545
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LinkedListCycle.java) |
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
from typing import List
2+
3+
4+
class Solution:
5+
def maxProfit(self, prices: List[int]) -> int:
6+
buy_price, sell_price, profit = prices[0], prices[0], 0
7+
for price in prices:
8+
if price < sell_price:
9+
profit += sell_price - buy_price
10+
buy_price = price
11+
sell_price = price
12+
else:
13+
sell_price = price
14+
profit += sell_price - buy_price
15+
return profit

0 commit comments

Comments
 (0)