134. Gas Station
来源:互联网 发布:笔记本网络初始化失败 编辑:程序博客网 时间:2024/05/21 17:27
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.
class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { if (gas == null || cost == null || gas.length == 0 || cost.length == 0) { return -1; } int sum = 0; int total = 0; int index = -1; for(int i = 0; i<gas.length; i++) { sum += gas[i] - cost[i]; total += gas[i] - cost[i]; if(sum < 0) { index = i; sum = 0; } } return total < 0 ? -1 : index + 1; // index should be updated here for cases ([5], [4]); // total < 0 is for case [2], [2] }}
阅读全文
0 0
- [LeetCode]134.Gas Station
- LeetCode 134. Gas Station
- [Leetcode] 134. Gas Station
- 134. Gas Station
- [leetcode] 134. Gas Station
- Leetcode-134.Gas Station
- 134. Gas Station LeetCode
- 134. Gas Station
- Leetcode 134. Gas Station
- 134. Gas Station
- 134. Gas Station
- [LeetCode]134. Gas Station
- LeetCode 134. Gas Station
- leetcode 134. Gas Station
- LeetCode *** 134. Gas Station
- 134. Gas Station
- LeetCode 134. Gas Station
- 【LeetCode】134. Gas Station
- Codeforces 869 C. The Intriguing Obsession (组合数学)
- Django视图 view
- 第九章 浮动
- JZOJsenior1738.Heatwave
- 传返回值给CrimeListFragment+修改列表项
- 134. Gas Station
- map用法
- Linux查找命令小结
- 偷懒的西西【推荐】
- python3队列及循环队列基本实现
- STM32开发环境搭建
- Java中static关键词的作用
- 经典的Java基础面试题集锦
- Python学习记录