[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.

解法一：

dp解法没有通过OJ testtime。

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int len = gas.size();
        vector<int> dp(len,0); //gas when arrives station i
        
        for(int i=0; i<len; i++){
            int step = 0;
            for(int j=i; j<len+i; j++){
                int cur = j<len?j:j-len;
                int next = j+1<len?j+1:j+1-len;
                dp[next] = dp[cur]+gas[cur]-cost[cur];
                if(dp[next]<0){
                    dp[next] = 0;
                    break;
                }
                step++;
            }
            if(step==len) return i;
        }
        return -1;
    }
};

解法二：

如果整个过程中gas的总和大于cost，肯定可以走一圈。有了整个前提，就是遍历一遍数组，sum表示走到当前位置i，还剩的汽油，如果小于零，说明之前假设的出发位置不对，将始发位置改为i+1，sum置为零。

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