Leetcode 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 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.
转圈加油的问题，我们首先要知道能走完整个环的前提是gas的总量要大于cost的总量，这样才会有起点的存在。假设我们从i开始出发，在行进过程中走到j位置如果累加值出现负值，说明当前的起点是不符合作为起点的要求的，从i位置到j位置中的所有位置也都不符合起点要求(这点需要理解，从i到j不符合要求，说明从i到j之前累加都为正，但耗不起从j这段路径)，因此下个起始位置应该从j+1开始。可以申明两个int数值，一个记录油箱中的所有油，一个记录从起始位置出发累加的值。

C++
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int total = 0;
        int sum = 0;
        int start = 0;
        for(int i = 0;i < gas.size();++i)
        {
            total += gas[i]-cost[i];
            sum += gas[i]-cost[i];
            if(sum < 0)
            {
                start = i+1;
                sum = 0;
            }
        }
        if(total < 0)
            return -1;
        else
            return start;
    }