Merge pull request #2696 from AHTHneeuhl/0540

Author: aakhtar3

cpp/0540-single-element-in-a-sorted-array.cpp

@@ -0,0 +1,27 @@
+// Time complexity: O(log n)
+// Space complexity: O(1)
+
+class Solution
+{
+public:
+    int singleNonDuplicate(vector<int> &nums)
+    {
+        int left = 0, right = nums.size() - 2;
+
+        while (left <= right)
+        {
+            int mid1 = (left + right) >> 1;
+            int mid2 = mid1 ^ 1;
+            if (nums[mid1] == nums[mid2])
+            {
+                left = mid1 + 1;
+            }
+            else
+            {
+                right = mid1 - 1;
+            }
+        }
+
+        return nums[left];
+    }
+};

javascript/0540-single-element-in-a-sorted-array.js

@@ -0,0 +1,21 @@
+// Time Complexity: O(log n)
+// Space Complexity: O(1)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNonDuplicate = function (nums) {
+    let left = 0,
+        right = nums.length - 2;
+
+    while (left <= right) {
+        const mid1 = (left + right) >> 1;
+        const mid2 = mid1 ^ 1;
+
+        if (nums[mid1] === nums[mid2]) left = mid1 + 1;
+        else right = mid1 - 1;
+    }
+
+    return nums[left];
+};

typescript/0540-single-element-in-a-sorted-array.ts

@@ -0,0 +1,17 @@
+// Time Complexity: O(log n)
+// Space Complexity: O(1)
+
+function singleNonDuplicate(nums: number[]): number {
+    let left = 0,
+        right = nums.length - 2;
+
+    while (left <= right) {
+        const mid1 = (left + right) >> 1;
+        const mid2 = mid1 ^ 1;
+
+        if (nums[mid1] === nums[mid2]) left = mid1 + 1;
+        else right = mid1 - 1;
+    }
+
+    return nums[left];
+}