class Solution {
public:
    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
        if (start > destination) swap(start, destination);
        int Max1 = 0, Max2 = 0;
        int len = distance.size();
        for (int i = 0; i < start; i++) 
            Max2 += distance[i];
        for (int i = start; i < destination; i++)
            Max1 += distance[i];
        for (int i = destination; i < len; i++) 
            Max2 += distance[i];
        return Max1 < Max2 ? Max1 : Max2;
    }
};