leetcode第17题（gas_station）

题目：

There are N gas stations along a circular route, where the amount of gas at station i isgas[i]. 

You have a car with an unlimited gas tank and it costscost[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.

思路：这是上算法课老师讲的贪心法的一个例题。如果有借，则必须从start出发才能走完全程。这也透露出一个信息——从另外的点出发，走到start-1剩余的油<0，没办法走到start。因此下一步有可能是真正的起点，但下一步要是真正的起点，其总的耗油量要大于等于0。

代码：

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        if(gas == null || cost == null || gas.length==0 || cost.length==0){
            return -1;
        }
        int index=-1;
        int sum =0;
        int remain = 0;
        for(int i=0;i<gas.length;i++){
            sum += gas[i]-cost[i];
            remain += gas[i]-cost[i];
            if(remain<0){
                remain = 0;
                index =i;
            }
        }
        return sum>=0?index+1:-1;
    }
}