-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution1719.java
More file actions
73 lines (69 loc) · 1.87 KB
/
Copy pathSolution1719.java
File metadata and controls
73 lines (69 loc) · 1.87 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
import java.util.Arrays;
/**
* @author abomb4 2022-09-26
*/
public class Solution1719 {
public static void main(String[] args) {
Solution1719 s = new Solution1719();
System.out.println(Arrays.toString(s.missingTwo(new int[]{1})));
}
public int[] missingTwo(int[] nums) {
final int n = nums.length + 2;
int sum = 0;
for (int i : nums) {
sum = sum ^ i;
}
for (int i = 1; i <= n; i++) {
sum = sum ^ i;
}
// sum = a ^ b
final int specialBit = sum & -sum;
int s1 = 0, s2 = 0;
for (int i : nums) {
if ((i & specialBit) == specialBit) {
s1 = s1 ^ i;
} else {
s2 = s2 ^ i;
}
}
for (int i = 1; i <= n; i++) {
if ((i & specialBit) == specialBit) {
s1 = s1 ^ i;
} else {
s2 = s2 ^ i;
}
}
return new int[]{s1, s2};
}
// public int[] missingTwo(int[] nums) {
// final int length = nums.length * 2;
// final int totalSum = (length + 1) * length / 2;
// final int totalSum2;
// {
// int sum = 1;
// for (int i = 2; i <= length; i++) {
// sum += i * i;
// }
// totalSum2 = sum;
// }
// // a + b
// final int m;
// // aa + bb
// final int n;
// {
// int sum1 = 0, sum2 = 0;
// for (int i : nums) {
// sum1 += i;
// sum2 += i * i;
// }
// m = totalSum - sum1;
// n = totalSum2 - sum2;
// }
// // (a+b)^2 = aa +2ab + bb = m^2
// // aa + bb = n
// // 2ab = m^2 - n
// // b = (mm - n) / 2a
// // a = (mm - n) / 2b
// // (mm - n)^2 / 4bb + bb = n
// }
}