[LeetCode] 133: Gas Station

[Problem]

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.

[Solution]

class Solution {
public:
	int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		// invalid
		if(gas.size() == 0 || cost.size() == 0 || gas.size() != cost.size())return -1;

		// check
		int begin = 0, end = 0;
		while(true){
			if(gas[begin] < cost[begin]){
				begin++;
				if(begin == gas.size())begin = 0;
			}
			else{
				int remain = 0;
				end = begin;
				while(true){
					// it's ok to jump to the next point
					if(remain + gas[end] - cost[end] >= 0){
						// update remained gas
						remain += gas[end] - cost[end];

						// the next point
						end++;

						// circle: jump to the first point
						if(end == gas.size())end = 0;
					}
					// it's impossible to jump to the next point
					else{
						// move begin to the next of end
						end++;
						if(end == gas.size())end = 0;

						// can the move begin
						if(begin == end)return -1;

						// move begin
						begin = end;
						break;
					}

					// it's possible to jump all points from begin
					if(end == begin)return begin;
				}
			}
			// it's impossible to jump all points
			if(begin == 0)break;
		}
		return -1;
	}
};

说明：版权所有，转载请注明出处。 Coder007的博客