gas-station leetcode C++

最新推荐文章于 2021-07-14 10:32:11 发布

原创最新推荐文章于 2021-07-14 10:32:11 发布 · 326 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C #leetcode #牛客网 #算法

算法同时被 3 个专栏收录

149 篇文章

订阅专栏

Algorithm

147 篇文章

订阅专栏

牛客网

146 篇文章

订阅专栏

本文探讨了在环形路线上寻找能够完成一次全程旅行的起始油站的问题。假设你驾驶一辆油箱无限大的汽车，从某个油站出发，需要经过所有油站并返回起点。每个油站提供一定量的汽油，同时消耗一定量的汽油才能到达下一个油站。文章提供了一个C++算法解决方案，用于确定能否完成旅行，并返回合适的起始油站索引。

There are N gas stations along a circular route, where the amount of gas at station i isgas[i].

You have a car with an unlimited gas tank and it costscost[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.

C++

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