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, otherwise return -1.

思路：常规思路是吧每一个点作为起点，遍历数组是否可行，但是最后case一个会超时。方法为设置两个flag分别为start和end，当前剩余为leave，如果leave<0，表示无剩余，如果有解的话必须向上借gas，那当前start就不说最终的，需要向前推进；leave>0表示有剩余，end可以向下推进，所以end向后推进。结束条件为start=end时候，如果当前leave>=0，表示有解start为返回值。否则无解。只需遍历一遍即可。

class Solution 
{
public:    
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) 
    {
        int len = gas.size();
        int leave=gas[len-1]-cost[len-1];
        int start=len-1;
        int end=0;
        while(start>end)
        {
            if(leave>0)
            { 
                leave=leave+gas[end]-cost[end];
                end=(end+1)%len;
            }
            else
            {
                start--;
                leave=leave+gas[start]-cost[start];
            }
        }       
        return leave<0?-1:start;            
    }
};