fix: mid = (left + right) / 2 to mid = left + (right - left) / 2 for avoding integer overflow and be consistent to the book

Author: Jer3myYu

java/Binary Search/CuttingWood.java

@@ -7,7 +7,7 @@ public int cuttingwood(int[] heights, int k) {
         while (left < right) {
             // Bias the midpoint to the right during the upper-bound binary 
             // search.
-            int mid = (left + right) / 2 + 1;
+            int mid = left + (right - left) / 2 + 1;
             if (cutsEnoughWood(mid, k, heights)) {
                 left = mid;
             } else {

java/Binary Search/FindTheInsertionIndex.java

@@ -3,7 +3,7 @@ public int findTheInsertionIndex(int[] nums, int target) {
         int left = 0;
         int right = nums.length;
         while (left < right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             // If the midpoint value is greater than or equal to the target, 
             // the lower bound is either at the midpoint, or to its left.
             if (nums[mid] >= target) {

java/Binary Search/FindTheTargetInARotatedSortedArray.java

@@ -4,7 +4,7 @@ public int findTheTargetInARotatedSortedArray(int[] nums, int target) {
         int left = 0;
         int right = nums.length - 1;
         while (left < right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             if (nums[mid] == target) {
                 return mid;
             }

java/Binary Search/FirstAndLastOccurrencesOfANumber.java

@@ -10,7 +10,7 @@ private int lowerBoundBinarySearch(int[] nums, int target) {
         int left = 0;
         int right = nums.length - 1;
         while (left < right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             if (nums[mid] > target) {
                 right = mid - 1;
             } else if (nums[mid] < target) {
@@ -28,7 +28,7 @@ private int upperBoundBinarySearch(int[] nums, int target) {
         int right = nums.length - 1;
         while (left < right) {
             // In upper-bound binary search, bias the midpoint to the right.
-            int mid = (left + right) / 2 + 1;
+            int mid = left + (right - left) / 2 + 1;
             if (nums[mid] > target) {
                 right = mid - 1;
             } else if (nums[mid] < target) {

java/Binary Search/LocalMaximaInArray.java

@@ -3,7 +3,7 @@ public int localMaximaInArray(int[] nums) {
         int left = 0;
         int right = nums.length - 1;
         while (left < right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             if (nums[mid] > nums[mid + 1]) {
                 right = mid;
             } else {

java/Binary Search/MatrixSearch.java

@@ -6,7 +6,7 @@ public boolean matrixSearch(int[][] matrix, int target) {
         int right = m * n - 1;
         // Perform binary search to find the target.
         while (left <= right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             int r = mid / n;
             int c = mid % n;
             if (matrix[r][c] == target) {

java/Binary Search/WeightedRandomSelection.java

@@ -17,7 +17,7 @@ private int select() {
         // Perform lower-bound binary search to find which endpoint (i.e., prefix 
         // sum value) corresponds to the target.
         while (left < right) {
-            int mid = (left + right) / 2;
+            int mid = left + (right - left) / 2;
             if (prefixSum[mid] < target) {
                 left = mid + 1;
             } else {