You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Find this single element that appears only once.
Follow up: Your solution should run in O(log n) time and O(1) space.
Example 1:
Input: nums = [1,1,2,3,3,4,4,8,8]
Output: 2
Example 2:
Input: nums = [3,3,7,7,10,11,11]
Output: 10
Constraints:
1 <= nums.length <= 10^5
0 <= nums[i] <= 10^5
解法二
class Solution {
public int singleNonDuplicate(int[] nums) {
int hi=nums.length;
int lo=0;
//[lo,hi)
while(lo<hi){
int mid=lo + (hi - lo) / 2;
boolean latterPartIsEven = (hi-mid)%2 == 0;
if(mid-1>=0 && nums[mid]==nums[mid-1]){
if(latterPartIsEven){
//保持搜索区间是奇数
lo=mid+1;
}
else{
hi=mid-1;
}
}
else if(mid+1<nums.length && nums[mid]==nums[mid+1]){
if(latterPartIsEven){
hi=mid;
}
else{
lo=mid;
}
}
else{
return nums[mid];
}
}
return 0;
}
}
解法三
class Solution {
public int singleNonDuplicate(int[] nums) {
int hi=nums.length;
int lo=0;
//[lo,hi)
while(lo<hi){
int mid=lo + (hi - lo) / 2;
//只看偶数index 如果mid index是奇数 则mid--
if(mid%2==1){
mid--;
}
//如果 nums[mid]==nums[mid+1] 说明要找的数在右边 反之亦然
if(mid+1<nums.length && nums[mid]==nums[mid+1]){
lo=mid+2;
}
else{
hi=mid;
}
}
return nums[lo];
}
}