leetcode 1184. Distance Between Bus Stops

题目
挺无聊的一题。一个环，两点之间的消耗的最小值，就是计算两段累加和就行。

class Solution {
    public int distanceBetweenBusStops(int[] distance, int start, int destination) {
        if(start>destination){
            int tmp = start;
            start = destination;
            destination = tmp;
        }
        for(int i=1;i<distance.length;i++){
            distance[i] += distance[i-1];
        }
        int res1 = start==0?distance[destination-1]:distance[destination-1]-distance[start-1];
        return Math.min(res1,distance[distance.length-1]-res1);
    }
}