题目描述
There are N gas stations along a circular route, where the amount of gas at station i isgas[i].
You have a car with an unlimited gas tank and it costscost[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.
解题思路1
从加油站i出发,依次加油,若到终点时,sum一直大于等于0,则返回i,否则i = i + 1,继续该过程
代码示例1
class Solution {
public:
int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
for (int j = 0; j < gas.size(); j++) {
int sum = 0;
int s = 0;
for (int i = j; s < gas.size(); i++, s++) {
sum += gas[i] - cost[i];
if (sum < 0) break;
if (i == gas.size() - 1 && j != 0) i = -1;
}
if (sum >= 0 && s == gas.size()) return j;
}
return -1;
}
};
缺点:嵌套for循环
解题思路2
从start出发, 如果油量足够, 可以一直向后走 end++; 油量不够的时候,
start向后退 最终 start == end的时候,如果有解一定是当前 start所在位置
代码示例2
class Solution {
public:
int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
int start = gas.size() - 1;
int end = 0;
int sum = gas[start] -cost[start];
while (end != start) {
if (sum >= 0) {
sum += gas[end] - cost[end];
end++;
} else {
start--;
sum += gas[start] - cost[start];
}
}
return sum >= 0 ? start : -1;
}
};