一、题目
二、代码
class Solution
{
public int searchInsert(int[] nums, int target)
{
int left = 0 ;
int right = nums.length-1;
int mid = left/2 + right/2;
// System.out.println(" left "+left);
// System.out.println(" right "+right);
if(target<nums[left]) return 0;
if(target>nums[right]) return right+1;
while(left<=right)
{
// System.out.println(" left "+left);
// System.out.println(" right "+right);
mid = (left + right)/2;
if(nums[mid] <target)
{
left = mid+1;
}
else if(nums[mid] > target)
{
right = mid-1;
}
else
{
return mid;
}
}
// System.out.println(" left "+left);
// System.out.println(" right "+right);
// System.out.println(" mid "+mid);
return left;
}
}