Leetcode——134 Gas Station

问题描述 ：

There are N gas stations along a circular route, where the amount of gas at stationi 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.

问题思路：

如果把两个数组对应加起来，问题转化一下就成了：一个数组，寻找某一位，从这一位开始依次向后累加，加和不会出现负值。其实想清楚一个问题就好了：

(1) 如果存在数组位置m和n，m到n-1之间的加和都是不小于0的，而m到n的加和为负数，那么m到n之间的任何一位都不是要找的。因为 任意的 sum[m,……m+i] >= 0 ，对应着 sum[m+i,……n-1] <= sum[m,……n-1]， 所以sum[m+i,……n] <0.

我结尾判断的时候最后做了点优化，时间复杂度o(n)：

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int s = 0,t = 0,v = 0;
        for(int i = 0; i< gas.size(); ++i){
            v += (gas[i]-cost[i]);
            if(v<0) { s += v; v = 0; t = i + 1; }
        }
        if( v+s < 0) return -1;
        else return t;
    }
};