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.

//感谢IT技术小屋的思路！

//此题蛮有意思的，思路如下：

//此题参考网上http://www.blogjava.net/menglee/archive/2013/12/19/407753.html
//由于gas[0] + gas[1] + ... + gas[n] >= cost[0] + cost[1] + .. + cost[n]
//那么必定有解，因为可转化为
//(gas[0] - cost[0]) + (gas[1] - cost[1]) + ... + (gas[n] - cost[n]) >= 0 （根据加法的交换性可有以下结论）
//只是其中某些可能为负，某些为正，但有解则必定正大于负数
//所以1、只需判断总和是否 >= 0 , 2、如果大于等于0，找出最后一个为(gas[i] - cost[i])累加为负的的下标，那么下一个索引值即为开始值！！！
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        
        int sum_part = 0;
        int sum_total = 0;
        int length = gas.size();
        int index_store = -1;
        
        for(int i = 0 ; i < length; i++)
        {
            sum_part += gas[i] - cost[i];//求和
            sum_total += gas[i] - cost[i];//求和
            
            if(sum_part < 0)//进行上面2的判断
            {
                index_store = i;
                sum_part = 0;//重新开始找为负的站
            }
        }
    
        if(sum_total >= 0)//有解
        {
            return index_store+1;//为负数的下一站！
        }
        return -1;
    }