solves distance between bus stops

Author: anishLearnsToCode

README.md

@@ -312,7 +312,7 @@
 | 1175 | [Prime Arrangements](https://leetcode.com/problems/prime-arrangements)                                                                               |                                                           [![Java](assets/java.png)](src/PrimeArrangements.java)                                                            |                                                                                                                                   |
 | 1176 | [Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance)                                                                         |                                                                                                                                                                             |                                                                                                                                   |
 | 1180 | [Count Substrings with only one Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter)                       |                                                                                                                                                                             |                                                                                                                                   |
-| 1184 | [Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops)                                                               |                                                                                                                                                                             |                                                                                                                                   |
+| 1184 | [Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops)                                                               |                                                        [![Java](assets/java.png)](src/DistanceBetweenBusStops.java)                                                         |                                                                                                                                   |
 | 1185 | [Day of the Week](https://leetcode.com/problems/day-of-the-week)                                                                                     |                                                                                                                                                                             |                                                                                                                                   |
 | 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons)                                                               |                                                                                                                                                                             |                                                                                                                                   |
 | 1196 | [How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket)                             |                                                                                                                                                                             |                                                                                                                                   |

src/DistanceBetweenBusStops.java

@@ -0,0 +1,17 @@
+import java.util.Arrays;
+
+public class DistanceBetweenBusStops {
+    public int distanceBetweenBusStops(int[] distance, int start, int destination) {
+        final int totalDistance = Arrays.stream(distance).sum();
+        final int path1 = getDistance(distance, start, destination);
+        return Math.min(path1, totalDistance - path1);
+    }
+
+    private int getDistance(int[] distances, int start, int end) {
+        int distance = 0;
+        for (int i = start ; i != end ; i = (i + 1) % distances.length) {
+            distance += distances[i];
+        }
+        return distance;
+    }
+}