Solution to LeetCode problem: 287 (#38)

* Added Solution to problem 287

Signed-off-by: Amisha Sahu <[email protected]>

* added time & space complexity

* Updated the code spacing and complexity.

* Update Solution.cpp

Author: Amisha328

Algorithms/Medium/287_FindTheDuplicateNumber/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int findDuplicate(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int n = nums.size();
+        for (int i = 0; i < n-1; i++)
+        {
+            if(nums[i] == nums[i+1])
+                return nums[i];
+        }
+        return -1;
+    }
+};
+
+// Time Complexity: O(nlogn)
+// Space Complexity: O(n)