Leetcode 134. Gas Station
来源:互联网 发布:上海卓易科技 大数据 编辑:程序博客网 时间:2024/06/03 15:02
题目:
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.
思路:
total表示所有加的油减去所有的消耗,如果>0,那么肯定是可以走完一圈的 ,只是目前还不知道起点从哪走
设先从起点0开始走,sum += (gas[i] - cost[i]);表示现存油箱里的油
如果发现sum<0了,那么我们就知道从0开始是走不到i的,并且从0到i的任何一个站出发,都走不到i,那么我们就可以直接令起点就是i,看从i开始走,能否走完一圈。
最后根据total的值判断能否走完一圈,并输出起点。
代码:
public class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { int total = 0; int sum = 0; int start = 0; for(int i = 0; i < gas.length; ++ i){ total += (gas[i] - cost[i]); if(sum < 0) { sum = gas[i] - cost[i]; start = i; } else{ sum += (gas[i] - cost[i]); } } return total <0? -1:start; }}
0 0
- [LeetCode]134.Gas Station
- LeetCode 134. Gas Station
- [Leetcode] 134. Gas Station
- [leetcode] 134. Gas Station
- Leetcode-134.Gas Station
- 134. Gas Station LeetCode
- Leetcode 134. Gas Station
- [LeetCode]134. Gas Station
- LeetCode 134. Gas Station
- leetcode 134. Gas Station
- LeetCode *** 134. Gas Station
- LeetCode 134. Gas Station
- 【LeetCode】134. Gas Station
- LeetCode - 134. Gas Station
- LeetCode 134. Gas Station
- LeetCode 134. Gas Station
- [leetcode] 134. Gas Station
- leetcode-134. Gas Station
- 【排序】洛谷 P1458 顺序的分数 Ordered Fractions
- Android-json解析(二):Jackson的使用
- iOS开发常用的宏
- 【luogu1280】尼克的任务(dp)
- mysql-5.7.18基本操作命令
- Leetcode 134. Gas Station
- 关于xx-net的小细节
- HQL语句多表联合查询的视图
- Navicat for Oracle连接数据库时报错"ORA-12737 set ZHS16GBK"
- [leetcode:python]1.Two Sum
- 理解JSON
- javaweb中表达式语言
- 浏览器缓存初识
- reactNative搭建开发环境