lintcode: 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.
Example
Given 4 gas stations with gas[i]=[1,1,3,1], and the
cost[i]=[2,2,1,1]. The starting gas station’s index is 2.

Note
The solution is guaranteed to be unique.

Challenge
O(n) time and O(1) extra space

这题挺难得，看了网上的思路才知道怎么写出O（n）的算法。
http://bookshadow.com/weblog/2015/08/06/leetcode-gas-station/
这篇文章讲的比较好。

这题要证明两个性质。

1.$\sum_{i=0}^n(gas[i]-cost[i])>=0$ 则必有解
很好理解

2.若从加油站A出发，恰好无法到达加油站C（只能到达C的前一站）。则A与C之间的任何一个加油站B均无法到达C。
反证：
假设从加油站A出发恰好无法到达加油站C，但是A与C之间存在加油站B，从B出发可以到达C。

而又因为从A出发可以到达B，所以A到B的油量收益（储油量 - 耗油量）为正值，进而可以到达C。

推出矛盾，假设不成立。

class Solution {
public:
    /**
     * @param gas: a vector of integers
     * @param cost: a vector of integers
     * @return: an integer 
     */
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        // write your code here
        int left_gas=0;
        int len=gas.size();

        for(int i=0;i<len;i++){
            left_gas+=gas[i]-cost[i];
        }
        if(left_gas<0){
            return -1;
        }else{
            left_gas=0;
        }

        int i=0;
        int cnt=0;
        int res=0;
        while(cnt<len){
            left_gas+=gas[i]-cost[i];
            if(left_gas<0){
                left_gas=0;
                cnt=0;
                res=(i+1)%len;
            }else{
                cnt++;
            }
            i=(i+1)%len;
        }
        return res;
    }
};