Merge branch 'youngyangyang04:master' into remote

problems/0134.加油站.md

@@ -78,7 +78,7 @@ public:
 ```
 
 * 时间复杂度：$O(n^2)$
-* 空间复杂度：$O(n)$
+* 空间复杂度：$O(1)$
 
 C++暴力解法在leetcode上提交也可以过。
 
@@ -239,6 +239,30 @@ class Solution {
 
 ### Python 
 ```python
+# 解法1
+class Solution:
+    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
+        n = len(gas)
+        cur_sum = 0
+        min_sum = float('inf')
+        
+        for i in range(n):
+            cur_sum += gas[i] - cost[i]
+            min_sum = min(min_sum, cur_sum)
+        
+        if cur_sum < 0: return -1
+        if min_sum >= 0: return 0
+        
+        for j in range(n - 1, 0, -1):
+            min_sum += gas[j] - cost[j]
+            if min_sum >= 0:
+                return j
+        
+        return -1
+```
+
+```python
+# 解法2
 class Solution:
     def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
         start = 0