Skip to content

Solution to LeetCode problem: 287 #38

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 4 commits into from
Jul 31, 2021
Merged

Solution to LeetCode problem: 287 #38

Changes from 2 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
e258009
Added Solution to problem 287
Amisha328 Jul 31, 2021
dcf6548
added time & space complexity
Amisha328 Jul 31, 2021
2ba4b52
Updated the code spacing and complexity.
Amisha328 Jul 31, 2021
7f957aa
Update Solution.cpp
Amisha328 Jul 31, 2021
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
16 changes: 16 additions & 0 deletions Algorithms/Medium/287_FindTheDuplicateNumber/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class Solution {
public:
int findDuplicate(vector<int>& nums) {
sort(nums.begin(),nums.end());
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Change this line to this:

sort(nums.begin(), nums.end());

int n =nums.size();
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Change this line to this:

int n = nums.size();

for(int i = 0;i<n-1;i++)
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Change this line to this:

for (int i = 0; i < n-1; i++)

{
if(nums[i] == nums[i+1])
return nums[i];
}
return -1;
}
};

// Time Complexity: O(n)
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Your solution's time complexity is O(nlogn) because of calling the sort function.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Oh, yes, thank you. I will do make changes.

// Space Complexity: O(n)