15分钟 - Gas Station
来源:互联网 发布:银鼎天贵金属行情软件 编辑:程序博客网 时间:2024/06/09 18:10
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.
public class Solution {
public int canCompleteCircuit(int[] gas, int[] cost) {
int len = gas.length;
if (len == 0) {
return -1;
} else if (len == 1) {
return gas[0] >= cost[0] ? 0 : -1;
}
int totalGas = 0;
int totalCost = 0;
for (int i = 0; i < len; i++) {
totalGas += gas[i];
totalCost += cost[i];
}
if (totalGas < totalCost) {
return -1;
}
int startPoint = 0;
while (startPoint <= len - 1) {
int currentGas = 0;
int i = startPoint;
for (; i <= startPoint + len && currentGas >= 0; i++) {
currentGas = currentGas + gas[i % len] - cost[i % len];
if (i == startPoint + len && currentGas >= 0) {
return startPoint;
}
}
if (currentGas < 0) {
startPoint = i;
continue;
}
}
return -1;
}
}
- 15分钟 - Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- 最小二乘法(最小平方法)
- 利用Eclipse使用Java OpenCV(Using OpenCV Java with Eclipse)
- 红黑树的实现与应用
- C++中引用与指针
- LIS问题(转换成LCS解法 O(n*n))
- 15分钟 - Gas Station
- 水性杨花女人的特点
- 节点datanode无法启动
- 个人赛 J: 导弹拦截系统
- 获取汉字首字母
- hdu1394 Minimum Inversion Number
- 在ASP.NET中操作文件的例子(VB)
- 如何实现动态添加Html文档中Form项
- 用FSO获得图片文件的信息(大小,宽,高)