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.
int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
int start = 0; // 起始位置
int remain = 0; // 当前剩余燃料
int debt = 0; // 前面没能走完的路上欠的债
for (int i = 0; i < gas.size(); i++) {
remain += gas[i] - cost[i];
if (remain < 0) {
debt += remain;
start = i + 1;
remain = 0;
}
}
return remain + debt >= 0 ? start : -1;
}