题目:
Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.
Example 1:
Input: [1,1,2,3,3,4,4,8,8] Output: 2
Example 2:
Input: [3,3,7,7,10,11,11] Output: 10
Note: Your solution should run in O(log n) time and O(1) space.
思路:
只有二分查找才能满足O(nlogn)的时间复杂度。这个二分查找需要分五种情况进行处理,请看下面的代码片段以及注释中的例子。
代码:
class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
int left = 0, right = nums.size() - 1;
while (left < right) {
int mid = left + (right - left) / 2;
if (nums[mid] == nums[mid + 1]) {
if (mid % 2 == 1) { // [1,1,2,4,4,8,8]
right = mid - 1;
}
else { // [1,1,2,2,4,4,8,8,9]
left = mid + 2;
}
}
else if (nums[mid] == nums[mid - 1]) {
if (mid % 2 == 1) { // [3,3,7,7,10,11,11]
left = mid + 1;
}
else { // [1,1,2,3,3,4,4,8,8]
right = mid - 2;
}
}
else { // [1,1,2,2,3,4,4,5,5]
return nums[mid];
}
}
return nums[left];
}
};