leetcode - 287. Find duplicates

leetcode - 287. Look for repetitions

subject

Code

#include <iostream>
#include <vector>
#include <set>
using namespace std;

//  With the help of set aggregate  
int findDuplicate1(vector<int>& nums) {
    
	int n = nums.size();
	set<int> visited;
	int num;
	for(int i = 0; i < n; i++){
    
		if(!visited.count(nums[i])){
    
			visited.insert(nums[i]);
		}else{
    
			num =  nums[i];
		}
	}
	return num;
}

//  Fast and slow pointer circle judgment  
int findDuplicate(vector<int>& nums) {
    
	int slow = 0, fast = 0;
	do{
    
		slow = nums[slow];
		fast = nums[nums[fast]];
	}while(slow != fast);
	slow = 0;
	while(slow != fast){
    
		slow = nums[slow];
		fast = nums[fast];
	}
	return slow;
}

int main(){
    
	int n, res;
	cin>>n;
	vector<int> nums(n);
	for(int i = 0; i < n; i++){
    
		cin>>nums[i];
	}
	res = findDuplicate(nums);
	cout<<res;
    return 0;
}