开始刷题leetcode day5： 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.

Java:

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int index = -1;
        int maxEnding = 0;
        int start = 0;
        int check = 0;
        for(int i=0; i<gas.length; i++)
        {
            if(maxEnding + gas[i] - cost[i] <0) 
            {
                start = i +1;
                maxEnding = 0;
            }
            else{
                maxEnding  = maxEnding + gas[i] - cost[i];
            }
        }
        if(maxEnding >= 0)
        index = start;
        
        if(index != -1)
        {
            for(int k = index; k < gas.length; k++)
            {
                check = gas[k] - cost[k] + check;
                if(check < 0) return -1;
            }
            for(int j = 0; j<index; j++)
            {
                check = check + gas[j] - cost[j];
                if(check < 0) return -1;
            }
        }
        
        return index;
    }
}

思想：找到第一个index能使之后所有的gas[i] - cost[i] 之和为正数或者为0

然后测试circle是否为true。基本上就是两次循环， O(n)time