-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfindMissing.java
More file actions
74 lines (46 loc) · 1.13 KB
/
Copy pathfindMissing.java
File metadata and controls
74 lines (46 loc) · 1.13 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
package sample;
public class findMissing {
public static void main(String[] args) {
//int a[]={2,3,4,5,6,7,8,9,10};
int a[]={1,2,3,5};
int n=5;
System.out.println(findMissing.missing(a));
System.out.println(findMissing.missing2(a,n));
System.out.println(findMissing.missingbitwise(a,n));
}
private static int missingbitwise(int[] a,int n) {
// TODO Auto-generated method stub
int missingnum=0;
for(int i:a) {
missingnum=missingnum^i;
}
for(int i=0;i<=n;i++) {
missingnum=missingnum^i;
}
return missingnum;
}
private static int missing(int[] a) {
// TODO Auto-generated method stub
int sum=0;
int expsum=0;
for(int i=0;i<a.length;i++) {
sum=a[i]+sum;
}
//System.out.println(sum);
for(int i=a.length+1;i>0;i--) {
//System.out.println(i);
expsum=i+expsum;
}
// System.out.println(expsum);
return expsum-sum;
}
private static int missing2(int[] a,int n) {
// TODO Auto-generated method stub
int sum=0;
int expsum=(n*(n+1))/2;
for(int i=0;i<a.length;i++) {
sum=a[i]+sum;
}
return expsum-sum;
}
}