134. Gas Station

最新推荐文章于 2019-07-07 22:09:15 发布

知之可否

最新推荐文章于 2019-07-07 22:09:15 发布

阅读量366

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/gao1440156051/article/details/52195362

版权

leetcode 专栏收录该内容

164 篇文章 1 订阅

订阅专栏

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.

如果totalGas大于totalCost了，那么就能走完整个里程了，假设现在我们到达了第i个油站，这时候还剩余的油量为sum，如果 sum + gas[i] - cost[i]小于0，我们无法走到下一个油站，所以起点一定不在第i个以及之前的油站里面（都铁定走不到第i + 1号油站），起点只能在i + 1后者后面。

class Solution {
public:
	int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
		int res=0;
		int sum=0;
		int total=0;
		for(int i=0;i<gas.size();i++){
			sum+=gas[i]-cost[i];
			if(sum<0){
				res=i+1;
				sum=0;
			}
			total+=gas[i]-cost[i];
		}
		if(total<0){
			return -1;
		}else{
			return res;
		}
	}
};

http://bookshadow.com/weblog/2015/08/06/leetcode-gas-station/