Add solution of 122, 134

Author: qlhai

.idea/Algorithms.iml

@@ -0,0 +1,11 @@
+from typing import List
+
+
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        profit_sum = 0
+        for i in range(1, len(prices)):
+            tmp = prices[i] - prices[i-1]
+            if tmp > 0:
+                profit_sum += tmp
+        return profit_sum

.idea/misc.xml

@@ -0,0 +1,15 @@
+from typing import List
+
+
+class Solution:
+    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
+        n = len(gas)
+        for i in range(n):
+            j = i
+            remain = gas[i]
+            while remain - cost[j] >= 0:
+                remain = remain - cost[j] + gas[(j + 1) % n]
+                j = (j + 1) % n
+                if j == i:
+                    return i
+        return -1