solves #2511: Maximum Enemy Forts That Can Be Captured in java

Author: anishLearnsToCode

README.md

@@ -789,7 +789,7 @@
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array)                                                           |                                                                               [![Java](assets/java.png)](src/MaximumValueOfAStringInAnArray.java)                                                                                |                                                                                                                                   |
 | 2500 | [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row)                                                                   |                                                                                [![Java](assets/java.png)](src/DeleteGreatestValueInEachRow.java)                                                                                 |                                                                                                                                   |
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings)                                                                         |                                                                                 [![Java](assets/java.png)](src/CountPairsOfSimilarStrings.java)                                                                                  |                                                                                                                                   |
-| 2511 | [Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured)                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2511 | [Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured)                                                     |                                                                             [![Java](assets/java.png)](src/MaximumEnemyFortsThatCanBeCaptured.java)                                                                              |                                                                                                                                   |
 | 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array)                         |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number)                                                           |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2525 | [Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria)                                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/MaximumEnemyFortsThatCanBeCaptured.java

@@ -0,0 +1,25 @@
+// https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured
+// T: O(N)
+// S: O(1)
+
+public class MaximumEnemyFortsThatCanBeCaptured {
+    public int captureForts(int[] forts) {
+        int last1 = Integer.MAX_VALUE, last_1 = Integer.MAX_VALUE, maxCapture = 0, previous = 0;
+        for (int index = 0 ; index < forts.length ; index++) {
+            if (forts[index] == 1) {
+                if (last_1 != Integer.MAX_VALUE && previous == -1) {
+                    maxCapture = Math.max(maxCapture, index - last_1 - 1);
+                }
+                previous = 1;
+                last1 = index;
+            } else if (forts[index] == -1) {
+                if (last1 != Integer.MAX_VALUE && previous == 1) {
+                    maxCapture = Math.max(maxCapture, index - last1 - 1);
+                }
+                previous = -1;
+                last_1 = index;
+            }
+        }
+        return maxCapture;
+    }
+}