leetCode#134 gas station

There are N gas stations along a circular route, where the amount of gas at station i isgas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel fromstation i to its next station (i+1). You begin the journey with an empty tank at one ofthe 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. 

解题思路：从第一个点开始，记录其为起点，计算从该点出发的话到每个剩余的点还剩下的油量，如果不剩余油，则说明该起点不能作为起点，而且起点到目前点上的所有点都不能作为起点，所以设置新的起点为 i+1，知道计算完所有的加油站，如果这时候算出的油量不为负值，则存在这样的起点，返回记录的起点，否则返回-1代码如下：

def canCompleteCircuit(self, gas, cost):
    total = 0
    sum = 0
    start = 0
    size = len(gas)
    for i in range(0, size):
        total += gas[i] - cost[i]
        sum += gas[i] - cost[i]
        if (sum < 0):
            start = i + 1
            sum = 0
    if (total >= 0):
        return start
    else:
        return -1