DistanceBetweenBusStops1184.kt

package easy

import kotlin.math.min

/**
 * A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the distance between the stops number i and (i + 1) % n.

The bus goes along both directions i.e. clockwise and counterclockwise.

Return the shortest distance between the given start and destination stops.

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.
 */

fun distanceBetweenBusStops(distance: IntArray, start: Int, destination: Int): Int {

    var clockWise = 0
    var totalDistance = 0
    /**
     * calculate total distance and clockwise distance
     * then get minimum between clockwise distance and [totalDistance- clockwiseDistance]
     */
    for (i in distance.indices) {
        if (start < destination && (i in start until destination)) {
            clockWise += distance[i]
        }
        if (start > destination && (i >= start || i < destination)) {
            clockWise += distance[i]
        }
        totalDistance += distance[i]
    }
    return min(clockWise, (totalDistance - clockWise))
}