Rearrange Array Elements by Sign

You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.

You should return the array of nums such that the the array follows the given conditions:

1. Every consecutive pair of integers have opposite signs.

2. For all integers with the same sign, the order in which they were present in nums is preserved.

3. The rearranged array begins with a positive integer.

Return the modified array after rearranging the elements to satisfy the aforementioned conditions.

LeetCode Problem - 2149

class Solution {
    public int[] rearrangeArray(int[] nums) {
        // Initialize arrays to hold positive and negative numbers separately.
        int[] resultArr = new int[nums.length]; // Array to store the rearranged numbers.
        int[] posArray = new int[(nums.length)/2]; // Array to hold positive numbers.
        int[] negArray = new int[(nums.length)/2]; // Array to hold negative numbers.

        // Counters to keep track of the positions in the positive and negative arrays.
        int posCount = 0;
        int negCount = 0;

        // Loop through the original array to separate positive and negative numbers.
        for(int i=0; i<nums.length; i++){
            if(nums[i]>0){
                posArray[posCount] = nums[i]; // Store positive number in positive array.
                posCount++; // Increment positive counter.
            } else {
                negArray[negCount] = nums[i]; // Store negative number in negative array.
                negCount++; // Increment negative counter.
            }
        }

        // Reset counters for reusing.
        posCount = 0;
        negCount = 0;

        // Loop through the original array to rearrange the numbers.
        for(int i=0; i<nums.length; i++){
            if(i%2==0){
                resultArr[i]=posArray[posCount]; // Place positive numbers at even indices.
                posCount++; // Move to the next positive number.
            } else {
                resultArr[i]=negArray[negCount]; // Place negative numbers at odd indices.
                negCount++; // Move to the next negative number.
            }
        }

        // Return the rearranged array.
        return resultArr;
    }
}