Add Solution.py for 0123.Best Time to Buy and Sell Stock III

Author: Hinsteny

solution/0123.Best Time to Buy and Sell Stock III/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        length = len(prices)
+        if 0 == length:
+            return 0
+        dp = [([0] * length) for i in range(3)]
+        for i in range(1, 3, 1):
+            maxdiff = -((1 << 31) - 1)
+            for j in range(1, length, 1):
+                maxdiff = max(maxdiff, dp[i-1][j-1] - prices[j-1])
+                dp[i][j] = max(dp[i][j - 1], maxdiff + prices[j])
+        return dp[2][length - 1]

solution/README.md

@@ -488,7 +488,8 @@
 ├── 0123.Best Time to Buy and Sell Stock III
 │   ├── README.md
 │   ├── Solution.cpp
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.py
 ├── 0124.Binary Tree Maximum Path Sum
 │   └── Solution.java
 ├── 0125.Valid Palindrome