Distance Between Bus Stops LeetCode solution in C++

1
class Solution {
2
 public:
3
  int distanceBetweenBusStops(vector<int> &distance, int start, int destination) {
4
    int n = distance.size();
5
    if (start == destination) return 0;
6

7
    int one_way = 0;
8
    int i = start;
9
    while (i != destination) // find distance of one way
10
    {
11
      one_way += distance[i];
12
      i = (i + 1) % n;
13
    }
14

15
    int second_way = 0;
16
    i = destination;
17
    while (i != start) // find distance of second way
18
    {
19
      second_way += distance[i];
20
      i = (i + 1) % n;
21
    }
22

23
    return one_way < second_way ? one_way : second_way; // return the minimum
24
  }
25
};