很不小心就想出來了
 [image] 
class Solution:
    def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int:
        return min(sum(distance)-sum(distance[min(start,destination):max(start,destination)]),sum(distance[min(start,destination):max(start,destination)])) # no need to add one cause arrive dont need the des cost