Skip to content

Create 287. Find the Duplicate Number1 #438

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 24, 2024
Merged

Create 287. Find the Duplicate Number1 #438

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions 287. Find the Duplicate Number1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
class Solution {
public:
int findDuplicate(vector<int>& nums) {
int ind = 0;

// sort the vector
sort(nums.begin(),nums.end());
for(int i = 0; i < nums.size() - 1; i++)
{
// if two consecutive elements are equal
// you have find a duplicate
// break the loop
if(nums[i] == nums[i+1])
{
ind = nums[i];
break;
}
}
// return duplicate value
return ind;
}
// for github repository link go to my profile.
};