-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathMissingNumber_Duplicates.java
More file actions
76 lines (55 loc) · 1.92 KB
/
MissingNumber_Duplicates.java
File metadata and controls
76 lines (55 loc) · 1.92 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.List;
public class MissingNumber_Duplicates {
public static void main(String [] args){
/*
These are here for testing purposes.
int [] testArray = {1,2,4};
System.out.println(sumMissingNumber(testArray,4));
System.out.println(xorMissingNumber(testArray,4));
int [] testArray2 = {1,1,3,3};
System.out.println(setMissingNumbers(testArray2,4));
*/
}
public static int sumMissingNumber(int array [], int length){
int result = 0;
int expectedSum = length *(length+1)/2;
int actualSum = 0;
for(int i:array){
actualSum +=i;
}
result =expectedSum - actualSum;
return result;}
public static int xorMissingNumber (int array [], int length){
int result = 0;
int rangeXor = 0;
int actualXor = 0;
for(int i =0; i<length+1 ;i++){
rangeXor = rangeXor ^ i;
}
for(int i: array){
actualXor = actualXor ^ i;
}
result = actualXor -rangeXor;
return result;}
public static Pair setMissingNumbers(int [] array, int length){
List<Integer> duplicates = new ArrayList<Integer>();
List<Integer> missingNumbers = new ArrayList<Integer>();
List<Integer> copyOfArray = new ArrayList<Integer>();
for( int i: array) {
if (copyOfArray.contains(i)) {
if (!duplicates.contains(i)) {
duplicates.add(i);
}
} else {
copyOfArray.add(i);
}
}
for(int i = 1; i <length+1; i++){
if( !copyOfArray.contains(i)){
missingNumbers.add(i);
}
}
return new Pair(duplicates,missingNumbers);}
}