题目:134. Gas Station
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.
分析
思路一:
最简单的算法就是一个一个点地计算,计算到没油了,证明这点不能作为出发点。移动到下一个点作为出发点。显然会超时。
思路二:
我觉得做这道题的关键是要可以总结出来这道题目的属性,其属性主要有两个:
1 如果总的gas - cost小于零的话,那么没有解返回-1
2 如果前面所有的gas - cost加起来小于零,那么前面所有的点都不能作为出发点。
第一个条件源于数学公式,这里就不证明了,判断第一个条件就是遍历一遍,判断sum_gas与 sum_cost的大小,只有满足时,才能判断第二个条件
第二个条件是用来确定起点的位置的。
代码
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int sum_gas= 0, sum_cost= 0, max= 0, sta_index;
for (int i= 0; i< gas.size(); i++) {
sum_gas+= gas[i];
sum_cost+= cost[i];
}
if (sum_gas< sum_cost) return -1;
else {
int sum= 0, res= 0;
for (int i= 0; i<gas.size(); i++) {
sum+= gas[i]-cost[i];
if (sum< 0) {
sum= 0;
res= i+1;
}
}
return res;
}
}
};