134. Gas Station 发表于 2022-07-17 12345678910111213141516class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { int totalRemainingGas = 0, remainingGas = 0, startIndex = 0; for (int i = 0; i < gas.length; i++) { totalRemainingGas += gas[i] - cost[i]; remainingGas += gas[i] - cost[i]; if (remainingGas < 0) { // 无法到达下一个加油站,只能从下一个加油站开始枚举 remainingGas = 0; startIndex = (i + 1) % gas.length; } } return totalRemainingGas < 0 ? -1 : startIndex; }} Reference134. Gas StationJava 1ms 详细说明起始点选取过程