[LeetCode]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.

题目中，第i站有油gas[i]，从第i站走到第i+1站会消耗油cost[i]，那么该问题等价于A[i] = gas[i] - cost[i]，能否找到下标k使得从第k个开始累加，累加过程中的和不会出现负数。

1、首先，无论从哪里开始累加，最终的累加结果sum{A[i]}若非负，则一定存在某个索引k使得从k开始累加保证sum在累加的过程非负。

证明：

class Solution {
public:
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost)
    {
        int i = 0, n = gas.size(); // A[n%gas.size()] is the head of the queue
        int sum = 0;
        for (int i = 0; i < n; i++)
        {
            sum += gas[i] - cost[i];
            while (i < n && sum < 0)
            {
                --n;
                sum += gas[n] - cost[n];
            }
        }
        return sum >= 0 ? n % gas.size() : -1;
    }
};