[LeetCode]Gas Station
来源:互联网 发布:白金数据的结局是什么 编辑:程序博客网 时间:2024/06/07 03:03
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.
贪心法 如果此前一段的和小于零,则从以下一个加油站为起点,最后判断加的气是否大于用掉的气,思路参照leetcodee题解
public class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { int all = 0; int sum = 0; int res = -1; for(int i = 0;i<cost.length;i++){ all += gas[i] - cost[i]; if(sum+gas[i]-cost[i]>=0){ sum +=gas[i]-cost[i]; }else{ sum = 0; res =i; } } return all>=0?(res+1):-1; }}
0 0
- LeetCode:Gas Station
- [LeetCode] Gas Station
- [leetcode]Gas Station
- Leetcode: Gas Station
- LeetCode:Gas Station
- [LeetCode] Gas Station
- leetcode Gas Station
- [LeetCode]Gas Station
- LeetCode 之 Gas Station
- leetcode Gas Station
- 【Leetcode】Gas Station
- LeetCode | Gas Station
- LeetCode之Gas Station
- Leetcode: Gas Station
- LeetCode OJ:Gas Station
- [LeetCode]134.Gas Station
- [Leetcode] Gas Station (Java)
- gas station leetcode
- 设计模式:外观模式
- 剑指offer系列源码-把字符串转换成整数
- HDOJ Let the Balloon Rise 1004
- 求4位数字的回文数
- linux查看匹配内容的前后几行
- [LeetCode]Gas Station
- hdu 2209 翻纸牌游戏(dfs)
- 设计模式:享元模式
- Android Studio 1.0正式版,安装后启动阻止其联网问题
- std::map
- SQL之函数
- 虚拟机软中断问题
- 网络流 -- Power Network(最大流算法)
- 设计模式:代理模式