public class Solution {
/**
* param A : an integer sorted array
* param target : an integer to be inserted
* return : an integer
*/
public int searchInsert(int[] A, int target) {
int left = 0, right = A.length - 1;
while(left <= right) {
int mid = (left + right) / 2;
if(A[mid] == target) return mid;
else if(A[mid] < target) left = mid + 1;
else right = mid - 1;
}
return left;
}
}
while循环中left<=right, 确保在target比最小值小(比最大值大)时,仍然可以进入循环并-1(+1)