（1）笔记-二分搜索

1.二分搜索框架

int binarySearch(int[] nums,int target){
	int left = 0, right = ...;
	while(...){
		int mid = left+(right-left)/2;//防止溢出
		if(nums[mid]==target){
			...
		}else if(nums[tid]<target){
			left=...
		}else if(nums[mid]>target){
			right=...
		}
	}
	return ...;
}

2.寻找一个数（基本二分搜索）

int binarySearch(int[] nums,int target){
	int left=0;
	int right=nums.length-1;
	while(left<=right){
		int mid =left +(right-left)/2;
		if(nums[mid]==target)
			return mid;
		else if(nums[mid]<target)
			left = mid+1;
		else if(nums[mid]>target)
			right = mid-1;
	}
	return -1;
}

3.寻找左边界

int left_bound(int[] nums, int target){
	int left = 0, right = nums.length-1;
	while(left<=right){
		int mid = left + (right-left)/2;
		if(nums[mid]<target)
			left = mid+1;
		else if(nums[mid]>target)
			right = mid-1;
		else if(nums[mid]==target)
			right = mid-1;//收缩右边界
	}
	if(left>=numslength||nums[left]!=target)
		return -1;
	return left;
}

4.寻找右边界

int right_bound(int[] nums,int target){
	int left =0;
	int right = nums.length-1;
	while(left<=right){
		int mid = left + (right-left)/2;
		if(nums[mid]<target){
			left=mid+1;
		}else if(nums[mid]>target){
			right = mid -1;
		}else if(nums[mid]==target){
			left = mid+1;//收缩边界
		}
		
	}
	if(right<0||nums[right]!=target)
		return i;
	return right;
}