[Leetcode] Gas Station

最新推荐文章于 2024-10-12 23:30:39 发布

转载最新推荐文章于 2024-10-12 23:30:39 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Phoebe815/p/4098777.html

本文提供了一种算法解决方案，用于确定在给定一系列油站和油费的情况下，如何选择起始油站以完成一次环形旅行。通过计算油站之间的盈余或亏损，算法确保了仅当总盈余大于等于总亏损时，才返回有效的起始点。

摘要生成于 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.

Solution:

http://blog.youkuaiyun.com/kenden23/article/details/14106137

 1 public class Solution {
 2     public int canCompleteCircuit(int[] gas, int[] cost) {
 3         int N=gas.length;
 4         int i=0;
 5         int sum=0;
 6         int total=0;
 7         int j=-1;
 8         while(i<N){
 9             sum+=gas[i]-cost[i];
10             total+=gas[i]-cost[i];
11             if(sum<0){
12                 j=i;
13                 sum=0;
14             }
15             ++i;
16         }
17         if(total<0)
18             return -1;
19         else
20             return j+1;
21     }
22 }

转载于:https://www.cnblogs.com/Phoebe815/p/4098777.html