-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path70.singleNonDuplicate.cpp
More file actions
executable file
·72 lines (69 loc) · 1.6 KB
/
Copy path70.singleNonDuplicate.cpp
File metadata and controls
executable file
·72 lines (69 loc) · 1.6 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
@filename 70.singleNonDuplicate.cpp
@author caonan
@date 2022-05-04 08:24:23
@reference 剑指offer专项
@url https://leetcode-cn.com/problems/skFtm2/
@brief 给定一个只包含整数的有序数组 nums ，每个元素都会出现两次，唯有一个数只会出现一次，请找出这个唯一的数字。
*/
#include <assert.h>
#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
class Solution
{
public:
/*
当 mid 是偶数时，mid&1 == 0
当 mid 是奇数时，mid&1 == 1
*/
int singleNonDuplicate(vector<int>& nums)
{
int l = 0;
int r = nums.size() - 1;
while (l < r) {
int mid = l + (r - l) / 2;
mid -= mid & 1;
if (nums[mid] == nums[mid + 1]) {
l = mid + 2;
} else {
r = mid;
}
}
return nums[l];
}
};
class Solution1 : public Solution
{
public:
/*
当 mid 是偶数时 mid^=1 == mid+1
当 mid 是奇数时 mid^=1 == mid-1
*/
int singleNonDuplicate(vector<int>& nums)
{
int l = 0;
int r = nums.size() - 1;
while (l < r) {
int mid = l + (r - l) / 2;
if (nums[mid] == nums[mid ^ 1]) {
l = mid + 1;
} else {
r = mid;
}
}
return nums[l];
}
};
int main() { return 0; }