Create 1567.Maximum-Length-of-Subarray-With-Positive-Product.cpp

wisdompeak · web-flow · commit dfaf03041b4b · 2020-10-09T18:08:16.000-07:00
diff --git a/Hash/1567.Maximum-Length-of-Subarray-With-Positive-Product/1567.Maximum-Length-of-Subarray-With-Positive-Product.cpp b/Hash/1567.Maximum-Length-of-Subarray-With-Positive-Product/1567.Maximum-Length-of-Subarray-With-Positive-Product.cpp
@@ -0,0 +1,30 @@
+class Solution {
+public:
+    int getMaxLen(vector<int>& nums) 
+    {
+        int ret = 0;
+
+        for (int i=0; i<nums.size(); i++)
+        {
+            if (nums[i]==0) continue;
+            int j = i;
+            int count = 0;
+            int firstNeg = -1;
+
+            while (j<nums.size() && nums[j]!=0)
+            {
+                count += (nums[j]<0);
+                if (count % 2 ==0)
+                    ret = max(ret, j-i+1);
+                else if (firstNeg!=-1)
+                    ret = max(ret, j-firstNeg);
+
+                if (firstNeg==-1 && nums[j]<0)
+                    firstNeg = j;
+                j++;
+            }
+            i = j;
+        }
+        return ret;
+    }
+};
