logn solution

shivamkumar177 · web-flow · commit 514be5c9b65b · 2020-05-12T19:11:40.000+05:30
diff --git a/WEEK 2/Question 5 Single Element in a Sorted Array.txt b/WEEK 2/Question 5 Single Element in a Sorted Array.txt
@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int singleNonDuplicate(vector<int>& nums) {
+        if(nums.size()==1)return nums[0];
+        for(int i=0,j=1;i<nums.size();i+=2)
+        {
+            if(nums[i]!=nums[j])return nums[i];
+            j+=2;
+        }
+        return nums[nums.size()-1];
+    }
+};
