LeetCode134：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 in the clockwise direction, otherwise return -1.

Note:

• If there exists a solution, it is guaranteed to be unique.
• Both input arrays are non-empty and have the same length.
• Each element in the input arrays is a non-negative integer.

Example 1:

Input: 
gas  = [1,2,3,4,5]
cost = [3,4,5,1,2]

Output: 3

Explanation:
Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
Travel to station 4. Your tank = 4 - 1 + 5 = 8
Travel to station 0. Your tank = 8 - 2 + 1 = 7
Travel to station 1. Your tank = 7 - 3 + 2 = 6
Travel to station 2. Your tank = 6 - 4 + 3 = 5
Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.
Therefore, return 3 as the starting index.

Example 2:

Input: 
gas  = [2,3,4]
cost = [3,4,3]

Output: -1

Explanation:
You can't start at station 0 or 1, as there is not enough gas to travel to the next station.
Let's start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
Travel to station 0. Your tank = 4 - 3 + 2 = 3
Travel to station 1. Your tank = 3 - 3 + 3 = 3
You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.
Therefore, you can't travel around the circuit once no matter where you start.

---

LeetCode：链接

题意：已知每个加油站能加的汽油gas[i]，还有第i个加油站到i+1个站点需要花费cost[i]的汽油。 假设初始油箱为空，且油箱容量无限，求从哪个站点开始，可以绕一圈。不存在返回-1

思路：首先想想朴素的算法，对于每个点，如果gas[i] – cost[i] >=0，那么以该点x为起点，向后判断。路途中若出现油箱为负，说明该起点不对。 起点x +1重复过程。

这样显然复杂度为o(n^2)，如何做到更好呢？

上面的过程在起点错误的时候直接进行了+1，就是初始起点的下一个。 就是说，假如abcdefg 这么多个加油站，a为一开始的站点，遍历到d发现不行了。接着从b开始。

然而这没有必要。 因为在过程中，有：

• gas[a] – cost[a] >=0 （这是枚举的条件）
• gas[a] – cost[a] + gas[b] – cost[b] >=0
• gas[a] – cost[a] + gas[b] – cost[b]  + gas[c] – cost[c] >=0
• gas[a] – cost[a] + gas[b] – cost[b]  + gas[c] – cost[c]  + gas[d] – cost[d] < 0

在d之前的每一步都是不小于0的。然而他们的累加过不了d这个站点，也就是说，abc都不会是解。（比0大的数加上去都过不了了何况不加）

而d也不会是解，因为必然有gas[d] – cost[d] < 0

因此接下来从e开始最好。

而且还要统计cost的总和是否大于gas的总和，如果大于，肯定是不能走完全程的！

class Solution(object):
    def canCompleteCircuit(self, gas, cost):
        """
        :type gas: List[int]
        :type cost: List[int]
        :rtype: int
        """
        # 如果cost的总和比gas的总和还要大 肯定不能走完一圈
        if sum(cost) > sum(gas):
            return -1
        start = 0
        reach = 0
        for i in range(len(gas)):
            if reach + gas[i] < cost[i]:
                reach = 0
                start = i + 1
            else:
                reach += gas[i] - cost[i]
        return start