Solution to LeetCode problem: 287 #38
Conversation
Signed-off-by: Amisha Sahu <[email protected]>
| class Solution { | ||
| public: | ||
| int findDuplicate(vector<int>& nums) { | ||
| sort(nums.begin(),nums.end()); |
There was a problem hiding this comment.
Change this line to this:
sort(nums.begin(), nums.end());| public: | ||
| int findDuplicate(vector<int>& nums) { | ||
| sort(nums.begin(),nums.end()); | ||
| int n =nums.size(); |
There was a problem hiding this comment.
Change this line to this:
int n = nums.size();| int findDuplicate(vector<int>& nums) { | ||
| sort(nums.begin(),nums.end()); | ||
| int n =nums.size(); | ||
| for(int i = 0;i<n-1;i++) |
There was a problem hiding this comment.
Change this line to this:
for (int i = 0; i < n-1; i++)| } | ||
| }; | ||
|
|
||
| // Time Complexity: O(n) |
There was a problem hiding this comment.
Your solution's time complexity is O(nlogn) because of calling the sort function.
There was a problem hiding this comment.
Oh, yes, thank you. I will do make changes.
|
Thank You @Tahanima. |
|
Hey, @Tahanima. |
|
This resolves #17 |
Thank you so much. Happy to contribute. 😀 |
Problem link: