You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.
Return the single element that appears only once.
Your solution must 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 <= 1050 <= nums[i] <= 105class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
int res = 0;
for(int n: nums)
res ^= n;
return res;
}
};class Solution {
public int singleNonDuplicate(int[] nums) {
int n = nums.length, lt = 0, rt = n - 1;
while (lt < rt) {
int mid = (lt + rt) / 2;
if (mid % 2 == 1) {
if (nums[mid] == nums[mid - 1])
lt = mid + 1;
else
rt = mid - 1;
} else {
if (nums[mid] == nums[mid + 1])
lt = mid + 2;
else
rt = mid;
}
}
return nums[rt];
}
}