Leetcode152: Gas Station

最新推荐文章于 2025-08-15 12:05:50 发布

银色子弹lx

最新推荐文章于 2025-08-15 12:05:50 发布

阅读量325

点赞数

分类专栏： leetcode c++ 文章标签： leetcode algorithm

c++ 同时被 2 个专栏收录

244 篇文章

订阅专栏

leetcode

243 篇文章

订阅专栏

本文探讨了一个环形油站路线问题，通过一个类Solution中的canCompleteCircuit方法来解决。方法通过遍历油站数组，计算剩余油量，并找出能够完成环形路线的起始油站。

摘要生成于 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) {
        if(gas.size()==0 || cost.size()==0 || gas.size()!=cost.size())  return -1;
        int sum = 0;
        int total = 0;
        int start = 0;
        for(int i = 0; i < gas.size(); i++)
        {
            total += gas[i]-cost[i];
            if(sum<0)
            {
                sum = gas[i]-cost[i];
                start = i;
            }
            else
                sum += gas[i]-cost[i];
        }
        return total<0? -1:start;
    }
};