Repository navigation
Expand file tree
/
Copy path18-MissingNumbers.java
More file actions
52 lines (47 loc) · 1.5 KB
/
Copy path18-MissingNumbers.java
File metadata and controls
52 lines (47 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.util.Scanner;
class MissingNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] numbers = readArray(scanner);
if (numbers.length == 0) {
System.out.println("Array is empty");
} else {
int minimum = numbers[0];
int maximum = numbers[0];
for (int number : numbers) {
minimum = Math.min(minimum, number);
maximum = Math.max(maximum, number);
}
System.out.print("Missing numbers: ");
boolean found = false;
for (int value = minimum; value <= maximum; value++) {
if (!contains(numbers, value)) {
System.out.print(value + " ");
found = true;
}
}
if (!found) {
System.out.print("None");
}
System.out.println();
}
scanner.close();
}
private static boolean contains(int[] numbers, int value) {
for (int number : numbers) {
if (number == value) {
return true;
}
}
return false;
}
private static int[] readArray(Scanner scanner) {
System.out.print("Enter array size: ");
int size = scanner.nextInt();
int[] numbers = new int[size];
for (int i = 0; i < size; i++) {
numbers[i] = scanner.nextInt();
}
return numbers;
}
}