Leetcode: 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.

c++:

class Solution {
public:
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        int size = gas.size();
        int sum = 0;
        int index = 0;
        int i;
        int sumg = 0;
        int sumc = 0;
        for(i = 0;i < size;i ++)
        {
            sumg += gas[i];
            sumc += cost[i];
            sum = sum + gas[i] - cost[i];
            if(sum < 0)
            {
                sum = 0;
                index = i + 1;
            }
        }
        if(sumg < sumc)
        {
            return -1;
        }
        return index % size;
    }
};