0134-gas-station

Try it on leetcode

Description

There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the journey with an empty tank at one of the gas stations.

Given two integer arrays gas and cost, return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique.

 

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.

 

Constraints:

• n == gas.length == cost.length
• 1 <= n <= 105
• 0 <= gas[i], cost[i] <= 104
• The input is generated such that the answer is unique.

Solution(Python)

class Solution:
    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
        #  gas = 1 2 3 4 5
        #  cost  = 3 4 5 1 2
        #  start at 4
        #   i = 3 tank = 0 + 4
        #   i =4  rank = 4 - 1 + 5 = 8
        #   i = 0 tk = 8- 2 + 1 = 7
        #   i = 1 tk = 7 - 3 + 2 = 6
        #   i = 2 tk = 6 - 4 + 3 = 5
        #   i = 3 tk = 5 - 5 + 3
        # 
        #   NET GAIN at single station i => current_tank + gas[i] - cost[i]
        #
        # if we sum up all netgains across every station it will tell wheter it is feasible at any point
        # gas[i] - cost[i] >= 0 if not it's not possible
        #
        # if solution exists
        #   starting from zero calculate netgain if accumlated postive gain goes zero at k
        #   rest currenttank to  k + 1 and start again
        #

        cur_tank = 0
        total_trip = 0
        start_station  = 0
        n = len(gas)
        for i in range(n):
            net_gain = gas[i] - cost[i]
            cur_tank += net_gain
            total_trip += net_gain
            if cur_tank < 0:
                cur_tank = 0 
                start_station = i + 1
        return start_station if total_trip >= 0  else -1