leetcode刷题DAY1

704.二分查找
输入：一组已排序的数组
输出：目标元素的下标

// nums为已从小到大排序的数组，numsSize为数组元素个数，target为查找目标元素
int search(int* nums, int numsSize, int target){
    int left=0, right=numsSize-1;
    int mid=0;
    while(left<=right){
	    mid=(left+right)/2;
	    if(target<nums[mid]){
	        right=mid-1;
	    }
        else if(target>nums[mid]){
	        left=mid+1;
	    }
        else{
	        return mid;
	    }
	}
	return -1;
}