加油站问题

/*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.*/
//原理很简单，借鉴最大字串和即可
#include <iostream>
#include <vector>

class Solution
{
public:
	int calCompleteCircuit(std::vector<int>& gas,std::vector<int>& cost)
	{
		if(gas.size()!=cost.size() || gas.size()<=0)
			return -1;
		int index=-1;
		int max=0;
		int count=0;
		int tem=0;
		for(int i=0;i<gas.size();++i)
		{
			tem=gas[i]-cost[i];
			count+=tem;
			if(max+tem<0)
			{
				max=0;
				index=-1;
			}
			else if(max==0)
			{
				max+=tem;
				index=i;
			}
			else
			{
				max+=tem;
			}
		}
		return count<0?-1:index;
	}
};

int main(int argc,char* argv[])
{
        //没有给出测试用例，代码正确，已AC
	return 0;
}