LeetCode 134. 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.

这题如果对每一个加油站点开始都循环计算的话会超时，所以有一个技巧,如果从i, i+1, i+2,….知道前往j的时候油不够了，那么从i 到 j之间任意的点都是无法走到j的，因此下次循环从j开始
至于结束条件，由于i从0开始如果 下次跳转的坐标 j >=0 && j <= i说明所有可能都已经遍历完成了 由于 j >=0所以结束条件就是 j <= i

这个题的边界有点绕，改了好几次

public int canCompleteCircuit(int[] gas, int[] cost) {

        int length = gas.length;
        int rout = 0;
        for (int i = 0; ;) {

            int[] sheng = new int[length];
            sheng[i] = gas[i];

            for (int j = i + 1;  ; j++) {
                int tmp = sheng[(j - 1) % length] - cost[(j - 1) % length];
                if (tmp >= 0) {
                    sheng[j % length] = tmp + gas[j % length];
                }else {

                    if(j % length < i) return -1;
                    i = j % length ;
                    break;
                }

                if(j % length == i) return i;
            }
        }

    }