【LeetCode】134. Gas Station 加油站（Medium）（JAVA）

【LeetCode】134. Gas Station 加油站（Medium）（JAVA）

题目地址: https://leetcode.com/problems/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 in the clockwise direction, otherwise return -1.

Note:

• If there exists a solution, it is guaranteed to be unique.
• Both input arrays are non-empty and have the same length.
• Each element in the input arrays is a non-negative integer.

Example 1:

Input: 
gas  = [1,2,3,4,5]
cost = [3,4,5,1,2]

Output: 3

Explanation:
Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
Travel to station 4. Your tank = 4 - 1 + 5 = 8
Travel to station 0. Your tank = 8 - 2 + 1 = 7
Travel to station 1. Your tank = 7 - 3 + 2 = 6
Travel to station 2. Your tank = 6 - 4 + 3 = 5
Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.
Therefore, return 3 as the starting index.

Example 2:

Input: 
gas  = [2,3,4]
cost = [3,4,3]

Output: -1

Explanation:
You can't start at station 0 or 1, as there is not enough gas to travel to the next station.
Let's start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
Travel to station 0. Your tank = 4 - 3 + 2 = 3
Travel to station 1. Your tank = 3 - 3 + 3 = 3
You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.
Therefore, you can't travel around the circuit once no matter where you start.

题目大意

在一条环路上有 N 个加油站，其中第 i 个加油站有汽油 gas[i] 升。

你有一辆油箱容量无限的的汽车，从第 i 个加油站开往第 i+1 个加油站需要消耗汽油 cost[i] 升。你从其中的一个加油站出发，开始时油箱为空。

如果你可以绕环路行驶一周，则返回出发时加油站的编号，否则返回 -1。

说明:

• 如果题目有解，该答案即为唯一答案。
• 输入数组均为非空数组，且长度相同。
• 输入数组中的元素均为非负数。

解题方法

1. 从 0 遍历到结束，判断当前 index 是否可以
2. 对于 index = i 判断是否可以，先从 i -> gas.length - 1：curGas += gas[j] - cost[j]; 必须要每次 curGas >= 0; 在从 0 -> i，也需要每次 curGas >= 0
3. 满足条件了直接返回结果就行

class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        for (int i = 0; i < gas.length; i++) {
            int curGas = gas[i] - cost[i];
            int index = i + 1;
            while (curGas >= 0 && index < gas.length) {
                curGas += gas[index] - cost[index];
                index++;
            }
            if (curGas < 0) continue;
            index = 0;
            while (curGas >= 0 && index < i) {
                curGas += gas[index] - cost[index];
                index++;
            }
            if (curGas >= 0) return i;
        }
        return -1;
    }
}

执行耗时:26 ms,击败了33.03% 的Java用户
内存消耗:38.6 MB,击败了91.83% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新