-
Notifications
You must be signed in to change notification settings - Fork 0
/
数组中重复的数字.cpp
36 lines (36 loc) · 892 Bytes
/
数组中重复的数字.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
#include<iostream>
#include<algorithm>
using namespace std;
class Solution {
public:
// Parameters:
// numbers: an array of integers
// length: the length of array numbers
// duplication: (Output) the duplicated number in the array number
// Return value: true if the input is valid, and there are some duplications in the array number
// otherwise false
bool duplicate(int numbers[], int length, int* duplication) {
sort(numbers, numbers + length);
int i = 0,j;
for (i = 0; i<length - 1; i++) {
if (numbers[i] == numbers[i + 1]) {
j = i;
break;
}
}
if (i == length - 1) return false;
else {
*duplication = numbers[j];
cout << *duplication << endl;
return true;
}
}
};
int main() {
int num [7]= {2,3,1,0,2,5,3};
Solution s;
int *d =NULL;
*d = 2;
s.duplicate(num, 7, d);
return 0;
}