import java.util.*; class Ideone { int[] twelveInt = new int [12]; int countEven = 0; int countOdd = 0; int countNeg = 0; for (int i = 0; i < twelveInt.length; i++) { twelveInt [i] = in.nextInt(); if (twelveInt[i] % 2 == 0){ countEven++; } if (twelveInt[i] % 2 != 0){ countOdd++; } if (twelveInt[i] < 0){ countNeg++; } } // declare and initialize result arrays with correct length int [] evens = new int [countEven]; int [] odds = new int [countOdd]; int [] negatives = new int [countNeg]; // reset counters - use them for populating the result arrays countEven = 0; countOdd = 0; countNeg = 0; // same logic, this time writing to result arays for (int i : twelveInt) { if (i % 2 == 0){ evens[countEven++] = i; } if (i % 2 != 0){ odds[countOdd++] = i; } if (i < 0){ negatives[countNeg++] = i; } } } }
1 2 3 4 5 -1 -3 -7 -9 -10 0 -2
Enter the #1 integer. Enter the #2 integer. Enter the #3 integer. Enter the #4 integer. Enter the #5 integer. Enter the #6 integer. Enter the #7 integer. Enter the #8 integer. Enter the #9 integer. Enter the #10 integer. Enter the #11 integer. Enter the #12 integer. evens: [2, 4, -10, 0, -2] odds: [1, 3, 5, -1, -3, -7, -9] negatives: [-1, -3, -7, -9, -10, -2]