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.

• 思路
  知道每个点的加油量和到下一个点的耗油量，求在此环上一点开始能否走一圈，能则返回开始下标，否则返回-1。
  首先算出净加油量(中间可以提前判断是否存在走一圈的情况)，然后对每个点遍历(2倍长度)。当净总量少于0时表示不能到达，从当前的下一个位置开始继续。当走够数量时且不存在不能到达的情况则返回起始下标。
  [类似于环形的最长字段和]

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        if(gas == null || cost == null || gas.length != cost.length)
            return -1;
        
        int sum = 0; //计算总费用
        int len = gas.length;
        for(int i=0; i<len; i++){
            gas[i] -= cost[i]; //净费用
            sum += gas[i]; 
        }
        if(sum < 0) //预判有没有可能存在
            return -1;
        
        int ans = 0;
        sum = 0;
        for(int i=0; i<len*2; i++){ //环形，用二倍的长度表示
            sum += gas[i%len];
            
            if(sum < 0){ //总费用不够时，从下一个点开始(因为之前的相加后是负数)
                ans = (i+1)%len;
                sum = 0;
            }
            
            if(sum >=0 && i - ans + 1 == len){
                return ans;
            }
        }
        
        return -1;
    }
}