134. Gas Station LeeCode

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 {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int n=gas.size();
        int count=0;       //计算经过的边数，当其为n时，说明全部站点都通过
        int total=1;       //计算循环的次数，超过n即说明没有通过全部站点的可能
        int index=0;       //记录起始站点的下标
        int sum=0;
        for(int i=index;count<n&&total<=n;)
        {
            sum+=gas[i]-cost[i];
            if(sum<0)
            {
                sum=0;      //重新设置参数值
                index=i+1;
                i=index%n;
                count=0;
                total+=1;
            }
            else 
            {
                count++;
                i++;
                i=i%n;
            }
        }
        if(count==n) return index%n;
        else return -1;
    }
};