# gas station c++

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.

int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
int tank=0, sum=0, pos=0;
for(int i=0;i<gas.size();i++)
{
tank += gas[i]-cost[i];
sum += gas[i]-cost[i];
if(tank<0)
{
tank=0;
pos=i+1;
}
}
if(sum<0)
return -1;
else
return pos%gas.size();
}

execution time: 56ms

# Resolving technical problems:

We provide Remote Technical Support from Monday to Sunday, 7:00PM to 1:00 AM

Mail your problem details at writeulearn@gmail.com along with your mobile numberand we will give you a call for further details. We usually attend your problems within 60 minutes and solve it in maximum 2 days.