114_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.

1:注意特殊情况；2:获得每一个站点剩余的gas；3:从某一个点遍历圆圈；4:注意不满足条件的情况

    int canCompleteCircuit(vector<int> &gas, vector<int> &cost)
    {
        if(gas.size() <= 0 || cost.size() <= 0 || gas.size() != cost.size())
        {
            return -1;
        }
        
        vector<int> left;
        int size = (int)gas.size();
        for(int i = 0; i < size; i++)
        {
            left.push_back(gas[i] - cost[i]);
        }
        
        int leftOil = 0;
        int index = 0;
        
        while(index < size)
        {
            while(index < size && left[index] < 0)
            {
                index++;
            }
            
            if(index == size)
            {
                return -1;
            }
            
            leftOil = left[index];
            int i = 1;
            for(; i < size; i++)
            {
                leftOil += left[(index+i) % size];
                if(leftOil < 0)
                {
                    break;
                }
            }
            if(i == size)
            {
                return index;
            }
            
            index = index + i;
        }
        
        return -1;
    }