LeetCode 1184 公交站间的距离[数组] HERODING的LeetCode之路

解题思路：
很简单的一道数组题，直接两个方向求和进行比较即可，另一个方向不方便求就拿全部求和结果减去正方向求和结果进行对比即可，代码如下：

class Solution {
public:
    int distanceBetweenBusStops(vector& distance, int start, int destination) {
        int total = accumulate(distance.begin(), distance.end(), 0);
        int dest1;
        if(start > destination) {
            dest1 = accumulate(distance.begin() + destination, distance.begin() + start, 0);
        } else {
            dest1 = accumulate(distance.begin() + start, distance.begin() + destination, 0);
        }
        return min(dest1, total - dest1);
    }
};