g2101_2200.s2149_rearrange_array_elements_by_sign.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g2101_2200.s2149_rearrange_array_elements_by_sign;

// #Medium #Array #Two_Pointers #Simulation #2022_06_08_Time_10_ms_(34.66%)_Space_231.2_MB_(5.61%)

public class Solution {
    public int[] rearrangeArray(int[] nums) {
        int[] negatives = new int[nums.length / 2];
        int[] positives = new int[nums.length / 2];
        int[] result = new int[nums.length];
        int pPtr = 0;
        int nPtr = 0;
        int rPtr = 0;
        for (int num : nums) {
            if (num > 0) {
                positives[pPtr++] = num;
            } else {
                negatives[nPtr++] = num;
            }
        }
        pPtr = 0;
        nPtr = 0;
        while (pPtr < positives.length && nPtr < negatives.length) {
            result[rPtr++] = positives[pPtr++];
            result[rPtr++] = negatives[nPtr++];
        }
        return result;
    }
}