Runtime: 0 ms (Top 100.0%) | Memory: 7.90 MB (Top 99.15%)

Author: AnasImloul

scripts/algorithms/M/Maximum Enemy Forts That Can Be Captured/Maximum Enemy Forts That Can Be Captured.cpp

@@ -1,33 +1,14 @@
+// Runtime: 0 ms (Top 100.0%) | Memory: 7.90 MB (Top 99.15%)
+
 class Solution {
-public:
+public: 
     int captureForts(vector<int>& forts) {
-        vector<int>cmd;
-        vector<int>arm;
-        int start_1=-1,start_m1=-1;
-        int ans=-1;
-        for(int i=0;i<forts.size();i++)
-        {
-            if(forts[i]==1)
-            {
-                if(start_m1!=-1)
-                {
-                    ans=max(ans,i-start_m1-1);
-                    start_m1=-1;
-                }
-                start_1=i;
+        int ans = 0; 
+        for (int i = 0, ii = 0; i < forts.size(); ++i) 
+            if (forts[i]) {
+                if (forts[ii] == -forts[i]) ans = max(ans, i-ii-1); 
+                ii = i; 
             }
-            else if(forts[i]==-1)
-            {
-                if(start_1!=-1)
-                {
-                    ans=max(ans,i-start_1-1);
-                    start_1=-1;
-                }
-                start_m1=i;
-            }
-            
-        }
-        if(ans==-1)return 0;
-        return ans;
+        return ans; 
     }
-};
+};