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

jelonmusk · Jul 13, 2023 · 742f2b8 · 742f2b8
1 parent e444a22
commit 742f2b8
Show file tree

Hide file tree

Showing 3 changed files with 13 additions and 10 deletions.
diff --git a/cpp/0540-single-element-in-a-sorted-array.cpp b/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;
  }
  }
 

diff --git a/javascript/0540-single-element-in-a-sorted-array.js b/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];

diff --git a/typescript/0540-single-element-in-a-sorted-array.ts b/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];