Prevent overflow for large integer numbers

vpop · vpop · commit e28c81a1fe25 · 2017-06-07T17:51:48.000-07:00
diff --git a/problems/src/binary_search/SearchRotatedSortedArray.java b/problems/src/binary_search/SearchRotatedSortedArray.java
@@ -34,7 +34,7 @@ public int search(int[] nums, int target)
         int low = 0, high = nums.length - 1;
         while(low < high)
         {
-            int mid = (low + high) / 2;
+            int mid = (low + high) >>> 1;
             if(nums[mid] == target)
                 return mid;
             if((nums[mid] <= nums[low]) && (target > nums[mid] && target <= nums[high]) ||

Original file line number	Diff line number	Diff line change
`@@ -34,7 +34,7 @@ public int search(int[] nums, int target)`
`34`	`34`	`int low = 0, high = nums.length - 1;`
`35`	`35`	`while(low < high)`
`36`	`36`	`{`
`37`		`- int mid = (low + high) / 2;`
	`37`	`+ int mid = (low + high) >>> 1;`
`38`	`38`	`if(nums[mid] == target)`
`39`	`39`	`return mid;`
`40`	`40`	`if((nums[mid] <= nums[low]) && (target > nums[mid] && target <= nums[high]) \|\|`