题目描述
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 in the clockwise direction, otherwise return -1.
Example 1:
Input:
gas = [1,2,3,4,5]
cost = [3,4,5,1,2]
Output: 3Explanation: Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
Travel to station 4. Your tank = 4 - 1 + 5 = 8
Travel to station 0. Your tank = 8 - 2 + 1 = 7
Travel to station 1. Your tank = 7 - 3 + 2 = 6
Travel to station 2. Your tank = 6 - 4 + 3 = 5
Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.
Therefore, return 3 as the starting index.
Example 2:
Input:
gas = [2,3,4]
cost = [3,4,3]Output: -1
Explanation: You can’t start at station 0 or 1, as there is not enough gas to travel to the next station.
Let’s start at station 2 and fill up with 4 unit of gas.
Your tank = 0 + 4 = 4 Travel to station 0.
Your tank = 4 - 3 + 2 = 3 Travel to station 1.
Your tank = 3 - 3 + 3 = 3
You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.
Therefore, you can’t travel around the circuit once no matter where you start.
分析
从 station[i] 到 station[i+1] 所消耗的汽油是 gas[i] - cost[i] ,若遍历整个数组后得到的汽油总数是正的,则证明有解决方案,若为负,则没有解决方案。
在确定有解决方案时,为了选择开始位置,可以从 station[0] 开始,计算累计的燃油数量,若在 station[i] 时燃油数量是负的,则说明需要在 station[i+1] 加油后才能到达 station[i],因为总汽油累计数为正。即找到累计燃油最小的站,从下一站开始,即可完成。
最终结果
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int petrol = 0, min = 0, res = 0;
for (int i = 0; i <gas.size(); i++) {
petrol += gas[i] - cost[i];
if (petrol < min) {
min = petrol;
res = (i+1) % gas.size();
}
}
if (petrol < 0)
return -1;
return res;
}
};;