就，顺时针路程加逆时针路程等于总路程，找最小即可

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

困难题我唯唯诺诺，简单题我重拳出击