#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/array-greedy-problems/gas-station-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/array-greedy-problems/gas-station-implementation

Repovive

Gas Station - Implementation - Array Greedy Problems | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Gas Station - Implementation

The code

function canCompleteCircuit(gas, cost)
 totalSurplus := 0
 currentSurplus := 0
 startStation := 0
 for i from 0 to length of gas - 1
 totalSurplus := totalSurplus + gas[i] - cost[i]
 currentSurplus := currentSurplus + gas[i] - cost[i]
 if currentSurplus < 0 then
 startStation := i + 1
 currentSurplus := 0
 if totalSurplus < 0 then
 return -1
 return startStation

Time: $O(n)$ . Space: $O(1)$ .