-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfind_dublicate.cpp
More file actions
41 lines (38 loc) · 890 Bytes
/
find_dublicate.cpp
File metadata and controls
41 lines (38 loc) · 890 Bytes
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
class Solution {
public:
int findDuplicate(vector<int>& nums) {
sort(nums.begin(), nums.end());
for(int i=0; i<nums.size() - 1; i++){
if(nums[i] == nums[i+1]){
return nums[i];
}
}
return -1;
}
};
//other way
int findDuplicate(vector<int>& nums) {
set<int> s;
for(int i=0; i<nums.size(); i++){
if(s.find(nums[i]) != s.end()){
return nums[i];
}
s.insert(nums[i]);
}
return -1;
}
//other way
int findDuplicate(vector<int>& nums) {
int slow = nums[0];
int fast = nums[0];
do{
slow = nums[slow];
fast = nums[nums[fast]];
}while(slow != fast);
slow = nums[0];
while(slow != fast){
slow = nums[slow];
fast = nums[fast];
}
return fast;
}