解决:以下标二分:
(1) 如果二分到下标是偶数,正常应该是后面和它相同。
(2) 如果二分下标是奇数,正常应该是前面和它相同。
Java:
class Solution {
public int singleNonDuplicate(int[] nums) {
int left = 0, right = nums.length - 1;
while (left < right) {
int middle = left + (right - left) / 2;
if (middle % 2 == 1) {
if (nums[middle] == nums[middle - 1]) {//下标最少是1不用担心溢出
left = middle + 1;
}
else {
right = middle;
}
}
else {
if (nums[middle] == nums[middle + 1]) {//每次二分总是偏向左,所以也不会溢出
left = middle + 2;
}
else {
right = middle;
}
}
}
return nums[left];
}
}
C++:
class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
if (nums.empty()) return 0;
int left = 0, right = nums.size() - 1;
while (left < right) {
int middle = (left + right) >> 1;
if ((middle % 2) == 0) {
if (nums[middle] == nums[middle + 1]) {//下标是偶数并且和后面数相同,说明前边都正常
left = middle + 2;
}
else {//下标是偶是但是和前面数字相同
if (nums[middle] != nums[middle - 1]) {//和前面数字都不相同,就直接输出了
return nums[middle];
}
else {
right = middle - 2;//和前面数字相同说明是前面数字乱了,往前找
}
}
}
else {
if (nums[middle] == nums[middle - 1]) {
left = middle + 1;
}
else {
if (nums[middle] != nums[middle + 1]) {
return nums[middle];
}
else {
right = middle - 1;
}
}
}
}
return nums[left];
}
};