fork download
  1. import java.util.*;
  2.  
  3. class Ideone {
  4. public static void main (String[] args) {
  5. Scanner in = new Scanner(System.in);
  6.  
  7. int[] twelveInt = new int [12];
  8.  
  9. int countEven = 0;
  10. int countOdd = 0;
  11. int countNeg = 0;
  12.  
  13. for (int i = 0; i < twelveInt.length; i++) {
  14. System.out.println("Enter the #" + (i + 1) + " integer.");
  15. twelveInt [i] = in.nextInt();
  16.  
  17. if (twelveInt[i] % 2 == 0){
  18. countEven++;
  19. }
  20. if (twelveInt[i] % 2 != 0){
  21. countOdd++;
  22. }
  23. if (twelveInt[i] < 0){
  24. countNeg++;
  25. }
  26. }
  27.  
  28. // declare and initialize result arrays with correct length
  29. int [] evens = new int [countEven];
  30. int [] odds = new int [countOdd];
  31. int [] negatives = new int [countNeg];
  32.  
  33. // reset counters - use them for populating the result arrays
  34. countEven = 0;
  35. countOdd = 0;
  36. countNeg = 0;
  37.  
  38. // same logic, this time writing to result arays
  39. for (int i : twelveInt) {
  40. if (i % 2 == 0){
  41. evens[countEven++] = i;
  42. }
  43. if (i % 2 != 0){
  44. odds[countOdd++] = i;
  45. }
  46. if (i < 0){
  47. negatives[countNeg++] = i;
  48. }
  49. }
  50.  
  51. System.out.println("evens: " + Arrays.toString(evens));
  52. System.out.println("odds: " + Arrays.toString(odds));
  53. System.out.println("negatives: " + Arrays.toString(negatives));
  54.  
  55. }
  56. }
Success #stdin #stdout 0.19s 55792KB
stdin
1 2 3 4 5 -1 -3 -7 -9 -10 0 -2
stdout
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]