Improved task 3467

Author: javadev

src/main/java/g3401_3500/s3467_transform_array_by_parity/Solution.java

@@ -1,19 +1,20 @@
 package g3401_3500.s3467_transform_array_by_parity;
 
-// #Easy #2025_03_02_Time_2_ms_(100.00%)_Space_45.06_MB_(100.00%)
-
-import java.util.Arrays;
+// #Easy #2025_03_06_Time_1_ms_(100.00%)_Space_45.26_MB_(23.27%)
 
 public class Solution {
     public int[] transformArray(int[] nums) {
-        for (int i = 0; i < nums.length; i++) {
-            if (nums[i] % 2 == 0) {
-                nums[i] = 0;
-            } else {
-                nums[i] = 1;
+        int size = nums.length;
+        int[] ans = new int[size];
+        int countEven = 0;
+        for (int num : nums) {
+            if ((num & 1) == 0) {
+                countEven++;
             }
         }
-        Arrays.sort(nums);
-        return nums;
+        for (int i = countEven; i < size; i++) {
+            ans[i] = 1;
+        }
+        return ans;
     }
 }