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.

看到题目第一反应是贪心算法；所以想也没想就直接枚举每一种情况，从0开始，看是不是可以走完，这样发现其实根本就是暴力枚举，没有任何的算法可言。然后仔细分析，发现其实很多地方是可以优化的，定义diff[i] = gas[i] - cost[i]；如果diff数组里面的每个元素和小于0的话，那么必然是没有可以到达的方式，直接返回-1；然后是从0开始，依次计算是否可能，如果发现到达j位置走不下去了，那么可能的出发点start的范围应该是 j <= start <= gas.size()，所以下次需找的点应该是从j继续往后走，这样可以将算法马上从0(N^2)的复杂度降低到0(N)的复杂度，只要遍历一遍diff数据，就可以找到可能的起始出发位置。所以看到题目还是得注意多分析，尽可能的优化时间复杂度。

int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int lenG = gas.size();
        int lenC = cost.size();
        if(lenG == 0 || lenC == 0 || (lenG != lenC))
        {
            return -1;
        }
        
        int sum = 0;
        vector<int> diff;
        int tmp = 0;
        for(int i = 0; i < lenG; ++i)
        {
            tmp = gas[i] - cost[i];
            diff.push_back(tmp);
            sum += tmp;
        }
        
        if(sum < 0)
            return -1;
        int index = 0;
        for(int i = 0; i < lenG; ++i)
        {
            int tmpSum = diff[i];
            if(tmpSum < 0)
                continue;
            int flag = 1;
            for(int j = i + 1; j < lenG; ++j)
            {
                tmpSum += diff[j];
                if(tmpSum < 0)
                {
                    flag = 0;
                    i = j;
                    break;
                }
            }
            
            if(flag)
            {
                index = i;
                break;
            }
        }
        
        return index;
    }