-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
540.java
56 lines (50 loc) · 1.63 KB
/
540.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
44
45
46
47
48
49
50
51
52
53
54
55
56
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public int singleNonDuplicate(int[] nums) {
int left = 0;
int right = nums.length / 2;
while (left < right) {
int mid = (left + right) / 2;
if (nums[mid * 2] != nums[mid * 2 + 1]) {
right = mid;
} else {
left = mid + 1;
}
}
return nums[left * 2];
}
}
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public int singleNonDuplicate(int[] nums) {
int count = 0;
//special for array length 0
if (nums.length == 0) return 0;
//special for array length 1
if (nums.length == 1) return nums[0];
for (int i = 0; i < nums.length-1; i++) {
//special for start of array
if (nums[0] != nums[1]) {
return nums[0];
}
if (i > 0 && nums[i-1] != nums[i] && nums[i] != nums[i+1]) {
return nums[i];
}
}
//special for end of array
return nums[nums.length-1];
}
}
__________________________________________________________________________________________________
sample 37156 kb submission
class Solution {
public int singleNonDuplicate(int[] nums) {
int result = 0;
for( int i = 0; i < nums.length; i++) {
result = result ^ nums[i];
}
return result;
}
}