38 lines
1.3 KiB
Java
38 lines
1.3 KiB
Java
|
package com.zerroi.leetcode.ThreeTen;
|
|||
|
|
|
|||
|
|
import java.util.Arrays;
|
|||
|
|
|
|||
|
|
public class CanCompleteCircuit {
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
SolutionFirst solutionFirst = new SolutionFirst();
|
|||
|
|
int res = solutionFirst.canCompleteCircuit(new int[]{2,1,5,3,3,4}, null);
|
|||
|
|
System.out.println("res = " + res);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
/*
|
|||
|
|
在一条环路上有 n 个加油站，其中第 i 个加油站有汽油 gas[i] 升。
|
|||
|
|
|
|||
|
|
你有一辆油箱容量无限的的汽车，从第 i 个加油站开往第 i+1 个加油站需要消耗汽油 cost[i] 升。你从其中的一个加油站出发，开始时油箱为空。
|
|||
|
|
|
|||
|
|
给定两个整数数组 gas 和 cost ，如果你可以按顺序绕环路行驶一周，则返回出发时加油站的编号，否则返回 -1 。如果存在解，则 保证 它是 唯一 的。
|
|||
|
|
*/
|
|||
|
|
class SolutionFirst {
|
|||
|
|
public int canCompleteCircuit(int[] gas, int[] cost) {
|
|||
|
|
int cur = 0;
|
|||
|
|
int station = 0;
|
|||
|
|
int stock = 0;
|
|||
|
|
for (int i = 0; i < gas.length; i++) {
|
|||
|
|
stock += gas[i] - cost[i];
|
|||
|
|
cur += gas[i] - cost[i];
|
|||
|
|
if (cur < 0) {
|
|||
|
|
station = i + 1;
|
|||
|
|
cur = 0;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
if (stock < 0) {
|
|||
|
|
return -1;
|
|||
|
|
}
|
|||
|
|
return station;
|
|||
|
|
}
|
|||
|
|
}
|