找出数组中唯一的重复元素

#include <iostream>
using namespace std;

int findRepeatNum(int* arr, int len) {
int result = 0;
for (int i = 1; i < len; ++i) {
result ^= i;
}

for (int i = 0; i < len; ++i) {
result ^= arr[i];
}
return result;
}

int main() {
int arr[] = { 1, 3, 2, 4, 2, 5 };

cout << "repeat num: " << findRepeatNum(arr, sizeof(arr) / sizeof(int))
<< endl;
return 0;
}