-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
260.java
43 lines (43 loc) · 1.15 KB
/
260.java
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
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public int[] singleNumber(int[] nums) {
int x = 0;
for (int i : nums) {
x ^= i;
}
int mask = 1;
while ((mask & x) == 0) {
mask <<= 1;
}
int copy = x;
for (int i : nums) {
if ((i & mask) != 0) {
x = x ^ i;
}
}
return new int[]{x, copy ^ x};
}
}
__________________________________________________________________________________________________
sample 34824 kb submission
class Solution {
public int[] singleNumber(int[] nums) {
int[] res=new int[2];
Set<Integer> set=new HashSet<>();
for(int n: nums){
if(set.contains(n)){
set.remove(n);
}else{
set.add(n);
}
}
int i=0;
for(int n: set){
res[i]=n;
i++;
}
return res;
}
}
__________________________________________________________________________________________________