15分钟 - Gas Station

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.

Solution comes in 10 mins. Used 5 mins to debug to working properly.

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int len = gas.length;
        
        if (len == 0) {
            return -1;
        } else if (len == 1) {
            return gas[0] >= cost[0] ? 0 : -1;
        }
        
        int totalGas = 0;
        int totalCost = 0;
        for (int i = 0; i < len; i++) {
            totalGas += gas[i];
            totalCost += cost[i];
        }
        
        if (totalGas < totalCost) {
            return -1;
        }


        int startPoint = 0;
        
        while (startPoint <= len - 1) {
            int currentGas = 0;
            int i = startPoint;
            for (; i <= startPoint + len && currentGas >= 0; i++) {
                currentGas = currentGas + gas[i % len] - cost[i % len];
                if (i == startPoint + len && currentGas >= 0) {
                    return startPoint;
                }
            }


            if (currentGas < 0) {
                startPoint = i;
                continue;
            }
        }
        
        return -1;
    }
}