Distance Between Bus Stops LeetCode solution in Java

1
class Solution {
2
  public int distanceBetweenBusStops(int[] distance, int start, int destination) {
3
    int firstDistance = 0;
4
    int secondDistance = 0;
5
    if (start < destination) {
6
      // check clockwise rotation
7
      for (int i = start; i < destination; i++) firstDistance += distance[i];
8
      // check clockwise rotation from destination to end
9
      for (int i = destination; i < distance.length; i++) secondDistance += distance[i];
10
      // continues checking till start (if needed)
11
      for (int i = 0; i < start; i++) secondDistance += distance[i];
12
    } else {
13
      for (int i = start; i < distance.length; i++) firstDistance += distance[i];
14
      for (int i = 0; i < destination; i++) firstDistance += distance[i];
15
      for (int i = start - 1; i >= destination; i--) secondDistance += distance[i];
16
    }
17
    return Math.min(firstDistance, secondDistance);
18
  }
19
}