Li Kou 1184. Distance between bus stops

subject

There are... On the circular bus route n Individual station , From 0 To n - 1 Number . We know the distance between each pair of adjacent bus stops ,distance[i] Indicates that the number is i The station and number are (i + 1) % n The distance between the stations .

The buses on the loop line can travel clockwise and counterclockwise .

Return passengers from the starting point start Destination destination The shortest distance between .

Example

Input ：distance = [1,2,3,4], start = 0, destination = 1
Output ：1
explain ： Bus stop 0 and 1 The distance between them is 1 or 9, The minimum is 1.

Input ：distance = [1,2,3,4], start = 0, destination = 2
Output ：3
explain ： Bus stop 0 and 2 The distance between them is 3 or 7, The minimum is 3.

Input ：distance = [1,2,3,4], start = 0, destination = 3
Output ：4
explain ： Bus stop 0 and 3 The distance between them is 6 or 4, The minimum is 4.

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/distance-between-bus-stops
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Method 1： simulation

Java Realization

class Solution {
    
    public int distanceBetweenBusStops(int[] distance, int start, int destination) {
    
        if (start > destination) {
    
            int tmp = start;
            start = destination;
            destination = tmp;
        }
        int sum = 0, n = distance.length, flag = 0;
        for (int i = 0; i < n; i++) {
    
            sum += distance[i];
            if (i >= start && i < destination) flag += distance[i];
        }
        return Math.min(flag, sum - flag);
    }
}