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.

Subscribe to see which companies asked this question

Difficulty: Medium

从前向后遍历，当k时，如果之前的和小于0，说明(0,k)没有起点。

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        vector<int> remain;
        int len = gas.size();
        if(len==0)
            return -1;
        int sum = 0;
        for(int i = 0;i<len;i++){
            remain.push_back(gas[i]-cost[i]);
            sum = sum + remain[i];
        }
        if(sum<0)
            return -1;
        if(len==1)
            return 0;
        int sum_front = 0, current = 0;
        for(int i = 0;i<len;i++){
            sum_front = sum_front + remain[i];
            if(sum_front<0){
                sum_front = 0;
                current = i+1;
            }
            
        }
        
        return current;
        
        
    }
};