add 1567

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1567|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) ||Greedy|Medium|
 |1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) ||Array|Easy|
 |1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) |[:tv:](https://youtu.be/hPe9Z3TiUrA)|Sort|Medium|
 |1560|[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) ||Array|Easy|

src/main/java/com/fishercoder/solutions/_1567.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+public class _1567 {
+    public static class Solution1 {
+        public int getMaxLen(int[] nums) {
+            int max = 0;
+            for (int i = 0; i < nums.length; i++) {
+                if (nums.length - i <= max) {
+                    return max;
+                }
+                if (nums[i] != 0) {
+                    int negatives = nums[i] > 0 ? 0 : 1;
+                    max = Math.max(max, nums[i] > 0 ? 1 : 0);
+                    for (int j = i + 1; j < nums.length; j++) {
+                        if (nums[j] < 0) {
+                            negatives++;
+                        } else if (nums[j] == 0) {
+                            break;
+                        }
+                        if (negatives % 2 == 0) {
+                            max = Math.max(max, j - i + 1);
+                        }
+                    }
+                }
+            }
+            return max;
+        }
+    }
+}

src/test/java/com/fishercoder/_1567Test.java

@@ -0,0 +1,47 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1567;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1567Test {
+    private static _1567.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1567.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.getMaxLen(new int[]{1, -2, -3, 4}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.getMaxLen(new int[]{0, 1, -2, -3, -4}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.getMaxLen(new int[]{-1, -2, -3, 0, 1}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(1, solution1.getMaxLen(new int[]{-1, 2}));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(4, solution1.getMaxLen(new int[]{1, 2, 3, 5, -6, 4, 0, 10}));
+    }
+
+    @Test
+    public void test6() {
+        assertEquals(0, solution1.getMaxLen(new int[]{-1}));
+    }
+
+}