leetcode 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.

思路  :有点类似循环链表，这里把数组后面接一个数组，模拟相同的功能

class Solution {
public:
	int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
		vector<int> myGas(gas);
		vector<int> myCost(cost);
		for (int i = 0; i < gas.size(); i++){
			myGas.push_back(gas[i]);
			myCost.push_back(cost[i]);
		}
		int n = gas.size();
		int i = 0;
		while (i < n){
			int a = 0;
			int cnt=0;
			for (int j=0; j <n; j++){
				a= a+(myGas[i + j]-myCost[i+j]);			
				if (a < 0){
					i = i + j+1;
					break;
				}
				cnt++;
			}
			if (cnt == n) return i;
		}
		return -1;	
	}
};