leetcode134. Gas Station

medium程度题

题目:

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.

我的想法是对每个点进行模拟，复杂度O(N * N)

AC解

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) 
    {
        int size = gas.size();
        vector<int> gap(size,0);
        for (int i = 0; i < size; i++)
            gap[i] = gas[i] - cost[i];
        
        int i = 0,j = 0;
        int sum = 0;
        for (i = 0; i < size; i++)
        {
            sum = 0;
            for (j = i; j < size; j++)
            {
                sum += gap[j];
                if (sum < 0)  break;
            }
            //如果到最后一个元素了
            if (j == size)
            {	//如果是从第一个站开始的，则行驶完了一圈
                if (i == 0)
                    break;
                    
                int m = 0;
                for (m = 0; m < i; m++)
                {
                    sum += gap[m];
                    if (sum < 0)  break;
                }
                //行驶完了一圈
                if (m == i)  break;
            }
            
        }
        
        if (i == size)
            return -1;
        return sum >= 0 ? i : -1;
    }
};

别人的高效解法,复杂度O(N)

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) 
    {
        int total = 0;//一圈计算完后total >= 0 则有解
        int result = -1;
        int size = gas.size();
        for (int i = 0,sum = 0; i < size; i++)
        {
            sum += gas[i] - cost[i];
            total += gas[i] - cost[i];
            
            if (sum < 0)
            {
                result = i;
                sum = 0;
            }
        }
        
        return total >= 0 ? result + 1 : -1;
    }
};