feat: add solutions to lc problem: No.2515

No.2515.Shortest Distance to Target String in a Circular Array

Author: YangFong

solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README.md

@@ -153,6 +153,59 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function closetTarget(
+    words: string[],
+    target: string,
+    startIndex: number,
+): number {
+    const n = words.length;
+    for (let i = 0; i <= n >> 1; i++) {
+        if (
+            words[(startIndex - i + n) % n] === target ||
+            words[(startIndex + i) % n] === target
+        ) {
+            return i;
+        }
+    }
+    return -1;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn closet_target(words: Vec<String>, target: String, start_index: i32) -> i32 {
+        let start_index = start_index as usize;
+        let n = words.len();
+        for i in 0..=n >> 1 {
+            if words[(start_index - i + n) % n] == target || words[(start_index + i) % n] == target
+            {
+                return i as i32;
+            }
+        }
+        -1
+    }
+}
+```
+
+### **C**
+
+```c
+int closetTarget(char **words, int wordsSize, char *target, int startIndex) {
+    for (int i = 0; i <= wordsSize >> 1; i++) {
+        if (strcmp(words[(startIndex - i + wordsSize) % wordsSize], target) == 0 ||
+            strcmp(words[(startIndex + i) % wordsSize], target) == 0) {
+            return i;
+        }
+    }
+    return -1;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README_EN.md

@@ -146,6 +146,59 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function closetTarget(
+    words: string[],
+    target: string,
+    startIndex: number,
+): number {
+    const n = words.length;
+    for (let i = 0; i <= n >> 1; i++) {
+        if (
+            words[(startIndex - i + n) % n] === target ||
+            words[(startIndex + i) % n] === target
+        ) {
+            return i;
+        }
+    }
+    return -1;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn closet_target(words: Vec<String>, target: String, start_index: i32) -> i32 {
+        let start_index = start_index as usize;
+        let n = words.len();
+        for i in 0..=n >> 1 {
+            if words[(start_index - i + n) % n] == target || words[(start_index + i) % n] == target
+            {
+                return i as i32;
+            }
+        }
+        -1
+    }
+}
+```
+
+### **C**
+
+```c
+int closetTarget(char **words, int wordsSize, char *target, int startIndex) {
+    for (int i = 0; i <= wordsSize >> 1; i++) {
+        if (strcmp(words[(startIndex - i + wordsSize) % wordsSize], target) == 0 ||
+            strcmp(words[(startIndex + i) % wordsSize], target) == 0) {
+            return i;
+        }
+    }
+    return -1;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/Solution.c

@@ -0,0 +1,9 @@
+int closetTarget(char **words, int wordsSize, char *target, int startIndex) {
+    for (int i = 0; i <= wordsSize >> 1; i++) {
+        if (strcmp(words[(startIndex - i + wordsSize) % wordsSize], target) == 0 ||
+            strcmp(words[(startIndex + i) % wordsSize], target) == 0) {
+            return i;
+        }
+    }
+    return -1;
+}

solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn closet_target(words: Vec<String>, target: String, start_index: i32) -> i32 {
+        let start_index = start_index as usize;
+        let n = words.len();
+        for i in 0..=n >> 1 {
+            if words[(start_index - i + n) % n] == target || words[(start_index + i) % n] == target
+            {
+                return i as i32;
+            }
+        }
+        -1
+    }
+}

solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/Solution.ts

@@ -0,0 +1,16 @@
+function closetTarget(
+    words: string[],
+    target: string,
+    startIndex: number,
+): number {
+    const n = words.length;
+    for (let i = 0; i <= n >> 1; i++) {
+        if (
+            words[(startIndex - i + n) % n] === target ||
+            words[(startIndex + i) % n] === target
+        ) {
+            return i;
+        }
+    }
+    return -1;
+}