1184. Distance Between Bus Stops 标准库带来的便利

最新推荐文章于 2024-10-04 20:45:38 发布

angela_NH

最新推荐文章于 2024-10-04 20:45:38 发布

阅读量148

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/angela_NH/article/details/106249317

版权

A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the distance between the stops number i and (i + 1) % n.

The bus goes along both directions i.e. clockwise and counterclockwise.

Return the shortest distance between the given start and destination stops.

Example 1:

Input: distance = [1,2,3,4], start = 0, destination = 1
Output: 1
Explanation: Distance between 0 and 1 is 1 or 9, minimum is 1.

Example 2:

Input: distance = [1,2,3,4], start = 0, destination = 2
Output: 3
Explanation: Distance between 0 and 2 is 3 or 7, minimum is 3.

Example 3:

Input: distance = [1,2,3,4], start = 0, destination = 3
Output: 4
Explanation: Distance between 0 and 3 is 6 or 4, minimum is 4.

Constraints:

1 <= n <= 10^4
distance.length == n
0 <= start, destination < n
0 <= distance[i] <= 10^4

这个题目说白了就是求2段距离，正向跟反向哪个大哪个小，运用std::accumulate，很方便。

class Solution {
public:
int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
int all = std::accumulate(distance.begin(), distance.end(), 0);
if(start > destination)
swap(start, destination);
int part = std::accumulate(distance.begin() + start, distance.begin()+destination, 0);
int second = all - part;
return min(part, second);
}
};

运行结果很酷。

Runtime: 4 ms, faster than 96.89% of C++ online submissions for Distance Between Bus Stops.

Memory Usage: 8.8 MB, less than 100.00% of C++ online submissions forDistance Between Bus Stops.