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.
//ref http://blog.csdn.net/fightforyourdream/article/details/16875259
public class Solution {
public int canCompleteCircuit(int[] gas, int[] cost) {
// dp
int curSum = 0;
int curRem = 0;
int start=0;
int total=0; // record the left after finishing a circle
for(int i=0;i<gas.length ;i++){
curRem = gas[i]-cost[i];
if(curSum>=0){
curSum += curRem;
}else{
start=i;
curSum = curRem;
}
total += curRem;
}
if(total<0) return -1;
return start;
}
}