Gas Station - LeetCode 134

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.

Hide Tags

  Greedy

分析：题目给定N个加油站gas[i]，和两两加油站之间的耗油量cost[i]，目标是要找出一个起始站的下标，使得从该站出发，依次达到以后每个站时，剩余油量不小于0.
思路：利用gas[i]-cost[i]构造一个diff数组，表示每个站在到达下一个站时剩下的油量。现在问题转化为找到这个数组中一个下标，使得从该位置开始依次到达后面的每个元素时的和不小于0，如果存在，则返回下标，如果不存在这样的元素，则返回-1.

/8ms
class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int siz = gas.size();
		vector<int> diff(siz,0);
		for(int i = 0;i < siz; i++){ //构造每个站剩余油量的数组
			diff[i] = gas[i] - cost[i];
		}
		
		for(int i = 0; i < siz; i++){
			if(diff[i] < 0) //只能从剩余油量大于0的位置出发
				continue;
			int sum = diff[i],flag = 0;
			int j = i + 1;
			for(; j < i + siz; j++ )
			{	
				sum += diff[j % siz];
				if(sum < 0)
				{
					flag = 1;
					break;
				}
			}
			if(flag == 1 && (i < j % siz)){
                                //如果剩余油量和小于0了，那么就从使得和小于0的下一个站且之前未验证过的站的开始
				i = j % siz; //注意循环条件会再加1
				continue;
				
			}
			if(sum >= 0){ //满足条件，返回起始站下标
				return i;
			}
		}
		return -1; //没有符合条件的起始站，返回-1
    }
};