add 1184

Author: fishercoder1534

README.md

@@ -19,6 +19,7 @@ _If you like this project, please leave me a star._ ★
 |1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | || [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ)|Easy||
 |1198|[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | | | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo)|Easy||
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | | |Easy||
+|1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | | | |Easy||
 |1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | | | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||

src/main/java/com/fishercoder/solutions/_1184.java

@@ -0,0 +1,54 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1184. Distance Between Bus Stops
+ *
+ * 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
+ * */
+public class _1184 {
+    public static class Solution1 {
+        public int distanceBetweenBusStops(int[] distance, int start, int destination) {
+            if (start > destination) {
+                int tmp = start;
+                start = destination;
+                destination = tmp;
+            }
+            int clockwise = 0;
+            for (int i = start; i < destination; i++) {
+                clockwise += distance[i];
+            }
+            int counterClockwise = 0;
+            for (int i = destination; i < distance.length; i++) {
+                counterClockwise += distance[i];
+            }
+            for (int i = 0; i < start; i++) {
+                counterClockwise += distance[i];
+            }
+
+            return Math.min(clockwise, counterClockwise);
+        }
+    }
+}

src/test/java/com/fishercoder/_1184Test.java

@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1184;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1184Test {
+    private static _1184.Solution1 solution1;
+    private static int[] distance;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1184.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        distance = new int[]{1, 2, 3, 4};
+        assertEquals(1, solution1.distanceBetweenBusStops(distance, 0, 1));
+    }
+
+    @Test
+    public void test2() {
+        distance = new int[]{1, 2, 3, 4};
+        assertEquals(4, solution1.distanceBetweenBusStops(distance, 0, 3));
+    }
+
+    @Test
+    public void test3() {
+        distance = new int[]{1, 2, 3, 4};
+        assertEquals(3, solution1.distanceBetweenBusStops(distance, 0, 2));
+    }
+
+    @Test
+    public void test4() {
+        distance = new int[]{7,10,1,12,11,14,5,0};
+        assertEquals(17, solution1.distanceBetweenBusStops(distance, 7, 2));
+    }
+
+}