首页 > 代码库 > [leetcode]Gas Station
[leetcode]Gas Station
Gas Station
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.
算法思路：
先找到哪些加油站可以安全起步，然后再逐个从这些安全的加油站出发。
代码如下：
1 public class Solution { 2 public int canCompleteCircuit(int[] gas, int[] cost) { 3 int[] stations = new int[gas.length]; 4 int count = gas.length,index = 0; 5 for(int i = 0; i < count;i++){ 6 if(gas[i] >= cost[i]){ 7 stations[index++] = i; 8 } 9 }10 breakable:11 for(int i = 0; i < index; i++){12 int gasCount = 0;13 int costCount = 0;14 for(int j = stations[i]; j < count + stations[i]; j++){15 gasCount += gas[j % count];16 costCount += cost[j % count];17 if(costCount > gasCount) continue breakable;18 }19 return stations[i];20 }21 return -1;22 }23 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。