Leedcode 算法习题 第十一周

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.

题目大意：

用g[i]记录每个加油站油的量，用cost[i]记录从i到下一个加油站的代价。如果可以旅游一周，就返回开始的index，否则返回-1.

我的解答：

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int n = gas.size();
        int total = 0; 
        int sum = 0;
        int start = 0;
        for(int i = 0 ;i < n; i++){
            int cur = gas[i]-cost[i];
            sum += cur;
            if(sum<0){
                start = i+1;
                sum = 0;
            }
            total +=cur;
        }
        return (total< 0)? -1 : start;
    }
};