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.
这个问题用中文描述就是,一个环形路上全是加油站,每个加油站能给你多少油事先给出,你的车从其中一个加油站出发,问能不能走完一圈。
解决这个问题其实就是从其中一个出发。碰到过不去的地方,就从那个坎出发再尝试一次,这是利用了一种贪心的思想,我们不需要逐个遍历,因为从之前任何一个点出发都不可能过得了这个坎。代码如下:
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int i, j, n = gas.size();
for (i = 0; i < n; i += j) {
int gas_left = 0;
// forward j stations
for (j = 1; j <= n; j++) {
int k = (i + j - 1) % n;
gas_left += gas[k] - cost[k];
if (gas_left < 0)
break;
}
if (j > n)
return i;
}
return -1;
}
};