N个环形加油站环绕一圈到起点

There are N gas stations along a circular route, where the amount of gas at station i isgas[i].
You have a car with an unlimited gas tank and it costscost[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.

public class Solution {
public int canCompleteCircuit(int[] gas, int[] cost) {
if(gas==null||gas.length==0){
return -1;
}
int N=gas.length;
int start=N-1;
int end=0;
int sum=gas[start]-cost[start];
while(start>end){
if(sum>=0){
sum=sum+gas[end]-cost[end];
end++;
}else{
start--;
sum=sum+gas[start]-cost[start];
}
}
return sum>=0?start:-1;
}
}

最后

以上就是虚心蜡烛为你收集整理的N个环形加油站环绕一圈到起点的全部内容，希望文章能够帮你解决N个环形加油站环绕一圈到起点所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。