134. Gas Station (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
        if sum(gas) - sum(cost) < 0:
            return -1
        n = len(gas)
        result = 0
        cur = 0
        for i in range(n):
            cur += gas[i] - cost[i]
            if cur < 0:
                result = i + 1
                cur = 0
        return result