add 2511

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -45,6 +45,7 @@
 | 2525 | [Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/)                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2525.java)                                       | [:tv:](https://youtu.be/dIciftyQXHo) | Easy                           ||
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2520.java)                                       | [:tv:](https://youtu.be/7SHHsS5kPJ8) | 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](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2515.java)                                       || Easy                                 ||
+| 2511 | [Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2511.java)                                       || Easy                                 |Array, Two Pointers
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2506.java)                                       || Easy                                 ||
 | 2500 | [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2500.java)                                       || Easy                                 ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                 ||

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2511.java

@@ -0,0 +1,22 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2511 {
+    public static class Solution1 {
+        public int captureForts(int[] forts) {
+            int max = 0;
+            for (int i = 0; i < forts.length; i++) {
+                if (forts[i] == 1 || forts[i] == -1) {
+                    for (int j = i + 1; j < forts.length; j++) {
+                        if ((forts[i] == 1 && forts[j] == -1) || (forts[i] == -1 && forts[j] == 1)) {
+                            max = Math.max(max, j - i - 1);
+                            break;
+                        } else if ((forts[j] == 1 && forts[i] == 1) || forts[j] == -1 && forts[i] == -1) {
+                            break;
+                        }
+                    }
+                }
+            }
+            return max;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2511Test.java

@@ -0,0 +1,21 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2511;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2511Test {
+    private static _2511.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2511.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.captureForts(new int[]{1, 0, 0, -1, 0, 0, 0, 0, 1}));
+    }
+}