Skip to content

Latest commit

 

History

History
119 lines (102 loc) · 3.29 KB

134. Gas Station.md

File metadata and controls

119 lines (102 loc) · 3.29 KB
Raw

134. Gas Station

leetcode Daily Challenge on September 23th, 2020.

leetcode-cn Daily Challenge on November 18th, 2020.

Difficulty : Medium

Related Topics : Greedy

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.

Solution

  • mine
    • Java
      • Runtime: 69 ms, faster than 14.24%, Memory Usage: 39.7 MB, less than 73.31% of Java online submissions 
        // O(N^2)time
// O(1)space
public int canCompleteCircuit(int[] gas, int[] cost) {
    int n = gas.length;
    for(int i = 0; i < n; i++){
        if(cost[i] > gas[i]) continue;
        int t = 0;
        for(int j = i; j < i + n; j++){
            t += gas[j % n] - cost[j % n];
            if(t < 0) break;

            if(j + 1 == i + n){
                return i;
            }
        }
    }
    return -1;
}
  • the most votes
  • Runtime: 0 ms, faster than 100.00%, Memory Usage: 39.9 MB, less than 49.31% of Java online submissions 
    // O(N)time
// O(1)space
public int canCompleteCircuit(int[] gas, int[] cost) {
    int sumGasLeft = 0;
    int start = 0;
    int total = 0;
    for (int i = 0; i < gas.length; i++) {
        int gasLeft = gas[i] - cost[i];
        if (sumGasLeft >= 0) {
            sumGasLeft += gasLeft;
        } else {
            sumGasLeft = gasLeft;
            start = i;
        }
        total += gasLeft;
    }
    return total < 0 ? -1 : start;
}