题目: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.
思路:假设有A 和B两个加油站,假设A为起点,如果汽车无法从A到达B(第一个无法到达的站),那么[A,B)之间的站都不可能为起点,可以将B设为起点继续。如果汽车能够走一个循环,那么Σ(gas[i]) >= Σ(cost[i])。 代码实现如下:
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int start = 0, tank = 0, total = 0;
for (int i = 0; i < gas.size(); i++) {
if ((tank = tank + gas[i] - cost[i]) < 0) {
start = i+1;
total += tank;
tank = 0;
}
}
return (total+tank) < 0 ? -1 : start;
}
};
参考链接:https://leetcode.com/problems/gas-station/discuss/42568