[Leetcode] 134. Gas Station

最新推荐文章于 2024-05-10 11:05:44 发布

MatthrewX

最新推荐文章于 2024-05-10 11:05:44 发布

阅读量405

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： Leetcode Greedy

本文链接：https://blog.youkuaiyun.com/u013897903/article/details/44991905

Leetcode 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一个算法问题，即如何在一条环形路线上找到合适的起点加油站，使得车辆能够完成一次完整的环路旅行。该问题通过分析各个加油站的油量与到达下一个加油站所需的油耗来解决。若存在解，则返回起始加油站的索引；否则返回-1。

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.

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