D. J.:

- Added LeetCode problem and solution for 122 Best Time to Buy and Sell Stock II

Author: nobodyPerfecZ

README.md

@@ -9,6 +9,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [80 Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/)
 - [88 Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
 - [121 Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)
+- [122 Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/)
 - [169 Majority Element](https://leetcode.com/problems/majority-element/description/)
 
 ## Development 🔧

awesome_python_leetcode/_122_best_time_to_buy_and_sell_stock_II.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        """
+        You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
+
+        On each day, you may decide to buy and/or sell the stock. You can only hold at
+        most one share of the stock at any time.
+        However, you can buy it then immediately sell it on the same day.
+
+        Find and return the maximum profit you can achieve.
+        """
+        left, right, best_profit = 0, 1, 0
+        while right < len(prices):
+            if prices[left] > prices[right]:
+                left = right
+                right += 1
+            elif prices[right] - prices[left] > 0:
+                best_profit += prices[right] - prices[left]
+                left = right
+                right += 1
+            else:
+                right += 1
+        return best_profit

tests/test_122_best_time_to_buy_and_sell_stock_II.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._122_best_time_to_buy_and_sell_stock_II import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["prices", "expected"],
+    argvalues=[
+        ([7, 1, 5, 3, 6, 4], 7),
+        ([1, 2, 3, 4, 5], 4),
+        ([7, 6, 4, 3, 1], 0),
+    ],
+)
+def test_func(prices: List[int], expected: int):
+    max_profit = Solution().maxProfit(prices)
+    assert max_profit == expected