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

Author: AHTHneeuhl

Diff for: cpp/0540-single-element-in-a-sorted-array.cpp

@@ -7,6 +7,7 @@ class Solution
     int singleNonDuplicate(vector<int> &nums)
     {
         int left = 0, right = nums.size() - 2;
+
         while (left <= right)
         {
             int mid = (left + right) >> 1;
@@ -19,6 +20,7 @@ class Solution
                 right = mid - 1;
             }
         }
+
         return nums[left];
     }
 };

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

@@ -6,15 +6,15 @@
  * @return {number}
  */
 var singleNonDuplicate = function (nums) {
-    let l = 0,
-        r = nums.length - 2;
+    let left = 0,
+        right = nums.length - 2;
 
-    while (l <= r) {
-        const m = (l + r) >> 1;
+    while (left <= right) {
+        const mid = (left + right) >> 1;
 
-        if (nums[m] === nums[m ^ 1]) l = m + 1;
-        else r = m - 1;
+        if (nums[mid] === nums[mid ^ 1]) left = mid + 1;
+        else right = mid - 1;
     }
 
-    return nums[l];
+    return nums[left];
 };

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

@@ -2,15 +2,15 @@
 // Space Complexity: O(1)
 
 function singleNonDuplicate(nums: number[]): number {
-    let l = 0,
-        r = nums.length - 2;
+    let left = 0,
+        right = nums.length - 2;
 
-    while (l <= r) {
-        const m = (l + r) >> 1;
+    while (left <= right) {
+        const mid = (left + right) >> 1;
 
-        if (nums[m] === nums[m ^ 1]) l = m + 1;
-        else r = m - 1;
+        if (nums[mid] === nums[mid ^ 1]) left = mid + 1;
+        else right = mid - 1;
     }
 
-    return nums[l];
+    return nums[left];
 }