LeetCode-gas-station

最新推荐文章于 2019-08-20 23:28:20 发布

六月二十七

最新推荐文章于 2019-08-20 23:28:20 发布

阅读量271

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： gas-station LeetCode

本文链接：https://blog.youkuaiyun.com/weixin_42146769/article/details/88565955

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文探讨了在环形路线上寻找能够完成一次完整旅行的起始油站的问题。假设你驾驶一辆油箱无限大的汽车，从某个油站出发，每经过一个油站，消耗的成本等于从当前油站到下一个油站的距离所需的油量。文章提供了一个算法解决方案，用于判断是否可以从某油站出发并返回，同时给出了实现这一目标的代码示例。

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

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.

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int [] rest = new int [gas.length];
         
        int res = 0;
         
        for(int i = 0; i < gas.length; ++i){
            rest[i] = gas[i] - cost[i];
            res += rest[i];
        }
         
        if(res < 0)
            return -1;
        int len = rest.length;
        for(int i = 0; i < rest.length; ++i){
            int start = (i+1)%len;
            int end = i;
            int total = rest[i];
            if(total < 0)
                continue;
            while(start != end){
                total += rest[start];
                if(total < 0)
                    break;
                start = (start + 1)%len;
            }
            if(total >= 0)
                return i;
            else
                continue;
        }
        return -1;
         
    }
}