Oldal Milán kódjában egy tömb felhasználásával és angol nyelven implementálta a számok páratlan tulajdonságának megállapítását.

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    int[] numbers = new int[10];
    boolean isOddNumber = false;
    for (int i = 0; i < numbers.length; i++) {
        System.out.println("Please enter numbers (in 10 laps)! - " + (i + 1) + ". lap");
        numbers[i] = input.nextInt();
        }
    int[] oddNumbers = new int[numbers.length];
    int pieces = 0;
    for(int i = 0; i < numbers.length; i++) {
        if(numbers[i] % 2 != 0) {
            oddNumbers[pieces] = numbers[i];
            isOddNumber = true;
            pieces++;
        }
    }
    if(isOddNumber){
    System.out.println("The odd numbers are:");
    for (int i = 0; i < oddNumbers.length; i++) {
        if(oddNumbers[i] > 0) {
            System.out.print(oddNumbers[i] + " ");
            }
        }
    }
    else{
        System.out.println("There is not any odd number among your numbers.");
        }
    }
}
 

Végeredmény:
Please enter numbers (in 10 laps)! - 1. lap
1
Please enter numbers (in 10 laps)! - 2. lap
2
Please enter numbers (in 10 laps)! - 3. lap
3
Please enter numbers (in 10 laps)! - 4. lap
4
Please enter numbers (in 10 laps)! - 5. lap
5
Please enter numbers (in 10 laps)! - 6. lap
6
Please enter numbers (in 10 laps)! - 7. lap
7
Please enter numbers (in 10 laps)! - 8. lap
8
Please enter numbers (in 10 laps)! - 9. lap
9
Please enter numbers (in 10 laps)! - 10. lap
10
The odd numbers are:
1 3 5 7 9