【LeetCode.134】Gas Station(加油站 | medium)

最新推荐文章于 2025-01-30 15:25:42 发布

原创最新推荐文章于 2025-01-30 15:25:42 发布 · 209 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

4 篇文章

订阅专栏

本文探讨了一个经典的计算机科学问题：在环形路径上，如何确定从哪个加油站开始可以完成一圈旅行，考虑到每个加油站提供的油量和从一个加油站到下一个加油站的油耗。文章提供了一种算法解决方案，并通过实例演示了其应用。

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 in the clockwise direction, otherwise return -1.

Note:

If there exists a solution, it is guaranteed to be unique.
Both input arrays are non-empty and have the same length.
Each element in the input arrays is a non-negative integer.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/gas-station
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

public class LeetCode134 {

    public int canCompleteCircuit(int[] gas, int[] cost){
        int start = 0, run = 0, rest = 0;
        for(int i = 0; i < gas.length; i ++){
            run += (gas[i] - cost[i]);
            rest += (gas[i] - cost[i]);
            if(run < 0){
                start = i + 1;
                run = 0;
            }
        }
        return rest < 0 ? -1 : start;
    }

    public static void main(String[] args) {
        int[] gas = new int[]{1,2,3,4,5};
        int[] cost = new int[]{3,4,5,1,2};
        LeetCode134 l = new LeetCode134();
        System.out.println(l.canCompleteCircuit(gas, cost));
    }
}