feat: 第 122 题添加新思路

Author: devin

docs/Leetcode_Solutions/Python/0122._Best_Time_to_Buy_and_Sell_Stock_II.md

@@ -56,3 +56,14 @@ class Solution(object):
             return 0
         return sum([max(prices[i+1]-prices[i], 0) for i in range(len(prices)-1)])
 ```
+简化思路：因为同一天可以卖买，所以只要第二天价高就卖出，不断积累收益，简单明了
+```python
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        profit = 0
+        for i in range(1, len(prices)):
+            if prices[i] > prices[i-1]:
+                profit += prices[i] - prices[i-1]
+        return profit
+            
+```