int search(int* nums, int numsSize, int target){
    int low=0,high=numsSize-1,mid,count=0;
    //二分查找
    while(low<=high){
        mid=(low+high)/2;
        if(nums[mid]==target){
            high=mid;
            break;
        }else if(nums[mid]>target){
            high=mid-1;
        }else{
           low=mid+1; 
        }
    }
    if(high<0){//防止数组越界
        return 0;
    }
    //向后搜索
    for(int i=high;i<numsSize;i++){
        if(nums[i]==target){
            ++count;
        }else{
            break;
        }
    }
    //向前搜索
    for(int i=high-1;i>=0;i--){
        if(nums[i]==target){
            ++count;
        }else{
            break;
        }
    }
    return count;
}