问题描述:
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.
先计算diff数组,定义为diff[] = gas[] - cost[]. 我一开始把问题理解成了“循环数组diff[]最大字段和问题”,处理起来比较麻烦。后来发现题目限制了solution is guanranteed to be unique,因此题目得到弱化,思路和求数组最大字段和很相似,只需要保证total>=0返回sum>=0的字段的起始位置。关于这个结论,这个帖子(https://www.cnblogs.com/felixfang/p/3814463.html)给出了相对详细的解释。
代码:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost){
int sum=0, total=0, diff=0, start=0;
for(int i=0;i<gas.size();i++){
diff=gas[i]-cost[i];
total+=diff;
sum+=diff;
if(sum<0){
sum=0;
start=i+1;
}
}
return total>=0?start:-1;
}