2022.7.24-----leetcode.1184

public int distanceBetweenBusStops(int[] distance, int start, int destination) {
        int n=distance.length;
        int[] pre=new int[n+1];
        for(int i=0;i<n;i++){
            pre[i+1]=pre[i]+distance[i];
        }
        int max=Math.max(start,destination);
        int min=Math.min(start,destination);
        return Math.min(pre[max]-pre[min],pre[n]-(pre[max]-pre[min]));
    }