-
Notifications
You must be signed in to change notification settings - Fork 0
/
set_mismatch.cpp
136 lines (125 loc) · 2.89 KB
/
set_mismatch.cpp
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
/*
* =====================================================================================
*
* Filename: set_mismatch.cpp
*
* Description: Set Mismatch.
*
* Version: 1.0
* Created: 03/08/19 01:58:05
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <unordered_set>
class Solution
{
public:
std::vector<int> findErrorNums(std::vector<int>& nums)
{
#ifdef __XOR__
return findByXor(nums);
#else
return findByTag(nums);
#endif
}
private:
std::vector<int> findByTag(std::vector<int>& nums)
{
int dup = 0;
int mis = 0;
for (size_t i = 0; i < nums.size(); i++)
{
int j = std::abs(nums[i]) - 1;
if (j < 0 || j >= nums.size() || nums[j] == 0)
{
// Invalid
break;
}
if (nums[j] > 0)
{
// Mark as nagative
nums[j] = -nums[j];
}
else
{
// Duplicate
dup = j + 1;
}
}
for (size_t i = 0; i < nums.size(); i++)
{
if (nums[i] > 0)
{
// Found missing
mis = i + 1;
}
}
if (dup > 0 && mis > 0)
{
return std::vector<int>({dup, mis});
}
return std::vector<int>();
}
std::vector<int> findByXor(std::vector<int>& nums)
{
/**
* index: a b c d e
* value: a b c c e
* val = (a ^ b ^ c ^ d ^ e) ^ (a ^ b ^ c ^ c ^ e) = d ^ c
* dup = c
* mis = (d ^ c) ^ c = val ^ dup
*/
std::unordered_set<int> s;
int dup = 0;
int mis = 0;
for (size_t i = 0; i < nums.size(); i++)
{
if (dup == 0)
{
if (s.count(nums[i]) > 0)
{
dup = nums[i];
}
s.insert(nums[i]);
}
mis ^= (i + 1) ^ nums[i];
}
if (dup > 0)
{
mis ^= dup;
return std::vector<int>({dup, mis});
}
return std::vector<int>();
}
};
int main(int argc, char* argv[])
{
std::vector<int> nums = {3, 2, 3, 4, 6, 5};
if (argc > 1)
{
nums.clear();
for (int i = 1; i < argc; i++)
{
nums.push_back(atoi(argv[i]));
}
}
auto errors = Solution().findErrorNums(nums);
if (errors.size() > 0)
{
printf("Error numbers:");
for (auto n: errors)
{
printf(" %d", n);
}
printf("\n");
}
return 0;
}