33. Search in Rotated Sorted Array (java) (optimized code)

Author: bluesword12350

solution/0033.Search in Rotated Sorted Array/Solution.java

@@ -3,7 +3,7 @@ public int search(int[] A, int target) {
         if (A == null || A.length == 0) return -1;
         int low = 0,high = A.length - 1;
         while (low <= high) {
-            int mid = (low + high) / 2;
+            int mid = low + ((high - low) >> 1);
             if (target < A[mid]) {
                 if (A[mid] >= A[high] && target < A[low]) low = mid + 1;
                 else high = mid - 1;