LeetCode 704. 二分查找

二分查找，很简单，思路就不写了

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