python3 解法, 执行用时: 46 ms, 内存消耗: 17.3 MB, 提交时间: 2024-09-16 09:24:40

class Solution:
    def distanceBetweenBusStops(self, distance: List[int], s: int, t: int) -> int:
        if s > t:
            s, t = t, s
        d1 = sum(distance[s: t])
        return min(d1, sum(distance) - d1)

golang 解法, 执行用时: 4 ms, 内存消耗: 2.7 MB, 提交时间: 2021-06-16 18:01:31

func distanceBetweenBusStops(distance []int, start int, destination int) int {
    m1, m2 := 0, 0 // 顺时针和逆时针
    s := 0
    for _, d := range distance {
        s += d
    }
    if start < destination {
        for i := start; i < destination; i++ {
            m1 += distance[i]
        }
        m2 = s - m1
    } else {
        for i := start-1; i >= destination; i-- {
            m2 += distance[i]
        }
        m1 = s - m2
    }

    return min(m1, m2)

}

func min(x, y int) int {
	if x > y {
		return y
	}
	return x
}