_1184. Distance Between Bus Stops.md

1184. Distance Between Bus Stops

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : May 31, 2024

Last updated : July 04, 2024

---

Related Topics : Array

Acceptance Rate : 54.34 %

---

    Notes
    A bit bulky but did it for the theoretical runtime savings. Still O(n) but 
    can save on the additional calclations if one direction is significantly
    shorter than the other by not having to have the additional addition operations.

---

Solutions

• e1184.py

Python

e1184.py

class Solution:
    def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int:
        counter, clockwise = start, start
        counterDist, clockwiseDist = 0, 0

        while not counter == destination and not clockwise == destination :
            counter = (counter - 1 + len(distance)) % len(distance)
            counterDist += distance[counter]

            clockwiseDist += distance[clockwise]
            clockwise = (clockwise + 1) % len(distance)

        if (clockwise == destination) :
            while not counter == destination and counterDist < clockwiseDist :
                counter = (counter - 1 + len(distance)) % len(distance)
                counterDist += distance[counter]

            if counter == destination and counterDist < clockwiseDist :
                return counterDist
            return clockwiseDist

        while not clockwise == destination and clockwiseDist < counterDist :
            clockwiseDist += distance[clockwise]
            clockwise = (clockwise + 1) % len(distance)

        if clockwise == destination and clockwiseDist < counterDist:
            return clockwiseDist
        return counterDist