_1567.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1567 {
publicstaticclassSolution1 {
publicintgetMaxLen(int[] nums) {
intmax = 0;
for (inti = 0; i < nums.length; i++) {
if (nums.length - i <= max) {
returnmax;
 }
if (nums[i] != 0) {
intnegatives = nums[i] > 0 ? 0 : 1;
max = Math.max(max, nums[i] > 0 ? 1 : 0);
for (intj = i + 1; j < nums.length; j++) {
if (nums[j] < 0) {
negatives++;
 } elseif (nums[j] == 0) {
break;
 }
if (negatives % 2 == 0) {
max = Math.max(max, j - i + 1);
 }
 }
 }
 }
returnmax;
 }
 }
}