int search(int* nums, int numsSize, int target){
int left,right,key=0;
left=0;right=numsSize;
while(left<right)
{
int mid=left+(right-left)/2;
if(nums[mid]<target)
{
left=mid+1;
}else
{
right=mid;
}
if(nums[mid]==target)
{
key=1;
}
}
if(key==1)
{
return left;
}else
{
return -1;
}
}