Refactor: 0540 - Single Element in a Sorted Array (ts,js,cpp)

Author: AHTHneeuhl

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

@@ -10,14 +10,15 @@ class Solution
 
         while (left <= right)
         {
-            int mid = (left + right) >> 1;
-            if (nums[mid] == nums[mid ^ 1])
+            int mid1 = (left + right) >> 1;
+            int mid2 = mid1 ^ 1;
+            if (nums[mid1] == nums[mid2])
             {
-                left = mid + 1;
+                left = mid1 + 1;
             }
             else
             {
-                right = mid - 1;
+                right = mid1 - 1;
             }
         }
 

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

@@ -10,10 +10,11 @@ var singleNonDuplicate = function (nums) {
         right = nums.length - 2;
 
     while (left <= right) {
-        const mid = (left + right) >> 1;
+        const mid1 = (left + right) >> 1;
+        const mid2 = mid1 ^ 1;
 
-        if (nums[mid] === nums[mid ^ 1]) left = mid + 1;
-        else right = mid - 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

@@ -6,10 +6,11 @@ function singleNonDuplicate(nums: number[]): number {
         right = nums.length - 2;
 
     while (left <= right) {
-        const mid = (left + right) >> 1;
+        const mid1 = (left + right) >> 1;
+        const mid2 = mid1 ^ 1;
 
-        if (nums[mid] === nums[mid ^ 1]) left = mid + 1;
-        else right = mid - 1;
+        if (nums[mid1] === nums[mid2]) left = mid1 + 1;
+        else right = mid1 - 1;
     }
 
     return nums[left];