LeetCode 134. Gas Station（加油站）

原题网址：https://leetcode.com/problems/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.

方法：两个指针，一个前进，一个后退（反向）

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int start = 0;
        int remain = gas[0] - cost[0];
        int stop = (start+1) % gas.length;
        while (start != stop) {
            if (remain < 0) {
                start = (start-1+gas.length) % gas.length;
                remain += gas[start] - cost[start];
            } else {
                remain += gas[stop] - cost[stop];
                stop = (stop+1) % gas.length;
            }
        }
        if (remain >= 0) return start; else return -1;
    }
}