Gas Station

最新推荐文章于 2024-10-12 23:30:39 发布

原创最新推荐文章于 2024-10-12 23:30:39 发布 · 645 阅读

0 ·

CC 4.0 BY-SA版权

leetcode习题分析专栏收录该内容

137 篇文章

订阅专栏

本文探讨了一个在循环路线上的汽油站旅行问题，其中每个汽油站的汽油量和从一个站到下一个站的费用都有明确给出。通过一个精心设计的算法，我们能够找出完成整个循环的起始汽油站，确保旅程得以顺利进行。文中详细解释了算法的实现过程，包括关键步骤和优化策略，旨在提高旅行效率并减少不必要的成本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int total = 0,sum = 0,diff = 0;;
        int j = -1;
        
        for(int i = 0;i<gas.size();i++)
        {
            diff = gas[i]-cost[i];
            total += diff;
            sum += diff;
            
            if(sum < 0)
            {
                j = i;
                sum = 0;
            }
        }
        
        return (total >=0)?j+1:-1;
    }
};

40 ms