Solving Distance Between Bus Stops in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: distance = [1,2,3,4], start = 0, destination = 1
Output: 1
Explanation: Distance between 0 and 1 is 1 or 9, minimum is 1.

Example 2:

Input: distance = [1,2,3,4], start = 0, destination = 2
Output: 3
Explanation: Distance between 0 and 2 is 3 or 7, minimum is 3.

Example 3:

Input: distance = [1,2,3,4], start = 0, destination = 3
Output: 4
Explanation: Distance between 0 and 3 is 6 or 4, minimum is 4.

Constraints:

  • distance.length == n

  • 0 <= start, destination < n

  • 0 <= distance[i] <= 10^4

  • distance.length == n

  • 0 <= start, destination < n

  • 0 <= distance[i] <= 10^4

See the full details of the problem Distance Between Bus Stops at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go