Maximum Count of Positive Integer and Negative Integer

Q - Given an array nums sorted in non-decreasing order, return the maximum between the number of positive integers and the number of negative integers.

• In other words, if the number of positive integers in nums is pos and the number of negative integers is neg, then return the maximum of pos and neg.

Note that 0 is neither positive nor negative.

LeetCode Problem: Link | Click Here

class Solution {
    public int maximumCount(int[] nums) {
        // Initialize the result variable to store the maximum count
        int result = 0;
        // Get the length of the input array
        int len = nums.length;
        // Initialize counters for positive and negative integers
        int positiveInt = 0;
        int negativeInt = 0;

        // Loop through each number in the array
        for (int num : nums) {
            // Check if the number is greater than 0 (positive)
            if (num > 0) {
                // Increment the count of positive integers
                positiveInt++;
            } else if (num < 0) { // Check if the number is less than 0 (negative)
                // Increment the count of negative integers
                negativeInt++;
            }
        }

        // Find the maximum count between positive and negative integers
        result = Math.max(positiveInt, negativeInt);

        // Return the maximum count of positive or negative integers
        return result;
    }
}