题目描述
环形路上有n个加油站,第i个加油站的汽油量是gas[i].
你有一辆车,车的油箱可以无限装汽油。从加油站i走到下一个加油站(i+1)花费的油量是cost[i],你从一个加油站出发,刚开始的时候油箱里面没有汽油。
求从哪个加油站出发可以在环形路上走一圈。返回加油站的下标,如果没有答案的话返回-1。
注意:
答案保证唯一。
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) {
if(gas.length != cost.length)
return -1;
int total = 0; //记录走完一圈剩余的油量,若total>=0,则必存在满足题目条件的加油站点下标
int sum = 0; //记录从i到i+1是否可行,即需判断剩余油量sum>=0是否成立
int index = 0; //初始化出发站点为第一个站点下标
for(int i = 0 ; i < gas.length; i++){
total += gas[i] - cost[i]; //累加走完一个站点的剩余油量
sum += gas[i] - cost[i]; //累加走完一个站点的剩余油量
if(sum < 0){ //若剩余油量小于0,则表示i到i+1不可达,将i+1记为出发站点,同时sum重新初始化为0
sum = 0;
index = i + 1;
}
}
return total >= 0? index : -1; //若total>=0,则返回满足条件的站点下标,否则返回-1
}
}