leetcodeOJ:134. Gas Station

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.

Return the starting gas station's index if you can travel around the circuit once, otherwise return -1.

Note:

The solution is guaranteed to be unique.

class Solution(object):
    def canCompleteCircuit(self, gas, cost):
        """
        :type gas: List[int]
        :type cost: List[int]
        :rtype: int
        """
        n = len(gas)
        total = 0
        tank = 0
        idx = 0
        for i in range(n):
            cur = gas[i] - cost[i]
            total += cur
            tank += cur
            if tank < 0:
                idx = i+1
                tank = 0
                
        if total < 0:
            return -1
        else:
            return idx