add 2515

Author: fishercoder1534

README.md

@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java)                                                                      || Easy                                                                          ||
+| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java)                                                                     || Easy                                                                          ||
+| 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java)                                                                     || Easy                                                                          ||
 | 2467 |[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2469.java)                                                                     || Easy                                                                          ||
 | 2455 |[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2455.java)                                                                     || Easy                                                                          ||
 | 2432 |[The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2432.java)                                                                     || Easy                                                                          ||

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

@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+public class _2515 {
+    public static class Solution1 {
+        public int closetTarget(String[] words, String target, int startIndex) {
+            int ans = words.length;
+            if (words[startIndex].equals(target)) {
+                return 0;
+            }
+            //move forward
+            int forwardSteps = 1;
+            for (int i = (startIndex + 1) % words.length; i != startIndex; i = ((i + 1) % words.length)) {
+                if (words[i].equals(target)) {
+                    ans = Math.min(ans, forwardSteps);
+                    break;
+                }
+                forwardSteps++;
+            }
+            //move backward
+            int backwardSteps = 1;
+            for (int i = (startIndex - 1 + words.length) % words.length; i != startIndex; i = ((i - 1 + words.length) % words.length)) {
+                if (words[i].equals(target)) {
+                    ans = Math.min(ans, backwardSteps);
+                    break;
+                }
+                backwardSteps++;
+            }
+            return ans == words.length ? -1 : ans;
+        }
+    }
+}

src/test/java/com/fishercoder/_2515Test.java

@@ -0,0 +1,36 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2515;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2515Test {
+    private static _2515.Solution1 solution1;
+    private static String[] words;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2515.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        words = new String[]{"hello", "i", "am", "leetcode", "hello"};
+        assertEquals(1, solution1.closetTarget(words, "hello", 1));
+    }
+
+    @Test
+    public void test2() {
+        words = new String[]{"a", "b", "leetcode"};
+        assertEquals(1, solution1.closetTarget(words, "leetcode", 0));
+    }
+
+    @Test
+    public void test3() {
+        words = new String[]{"i", "eat", "leetcode"};
+        assertEquals(-1, solution1.closetTarget(words, "ate", 0));
+    }
+
+}