forked from codemistic/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSingleElement.java
36 lines (29 loc) · 842 Bytes
/
SingleElement.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
public class SingleElement {
public static void main(String[] args) {
int[] nums = {3,3,7,7,10,11,11};
System.out.println(singleNonDuplicate(nums));
}
static int singleNonDuplicate(int[] nums) {
int s = 0;
int e = nums.length-1;
while(s < e){
int m = s + (e-s)/2;
if( (m < e) && (nums[m] == nums[m +1]) ){
if( (m -s) % 2 == 0 ){
s = m +2;
} else{
e = m-1;
}
} else if( (s < m) && (nums[m] == nums[m-1]) ){
if( (e-m) % 2 == 0 ){
e = m-2;
} else{
s = m+1;
}
} else{
return nums[m];
}
}
return nums[s]; //or e
}
}