1184. 公交站间的距离

原题链接：1184. 公交站间的距离

 

solution:

        

class Solution {
public:
    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
        int ans1 = 0, asn2 = 0; //保存正向和反向的距离
        int n = distance.size();
        for(int i = start;i != destination;i = (i + 1) % n) ans1 += distance[i];    //正向距离
        for(int i = destination;i != start;i = (i + 1) % n) asn2 += distance[i];    //逆向距离
        return min(ans1, asn2);
    }
};