二分法学习-几种变形的二分法

---

情景1：给定已排序好的数据（无重复值），找到给定的key值

代码如下

/**
	 * 情景1：给定已排序好的数据（无重复值），找到给定的key值
	 * @param nums
	 * @param key
	 */
	public int binarySearch1(int[] nums,int key) {
		int left = 0;
		int right = nums.length-1;
		while(left<=right) {
			int mid = left + ((right - left) >> 1);//相当于left+（right-left）/2;
			if(nums[mid] == key) {
				return mid;
			}
			if(key <nums[mid]) {//如果key小于mid,则说明key所在的区间在[left,mid-1]中间
				right = mid-1;
			}
			if(key > nums[mid]) {
				left = mid+1;
			}
		}
		return -1;
	}
	

情景二：查找第一个值等于给定值的元素的下标(nums数组有重复数据)

/**
	 * 情景二：查找第一个值等于给定值的元素的下标(nums数组有重复数据)
	 * @param nums
	 * @param key
	 * @return
	 */
	public int binarySearch2(int[] nums,int key) {
		int left = 0;
		int right = nums.length-1;
		while(left<right) {
			int mid = left + ((right - left) >> 1);
			if(key == nums[mid]) {//这里不能直接返回，因为mid之前也有可能有相同的key存在
				right = mid;
			}
			if(key <nums[mid]) {
				right = mid-1;
			}
			if(key >nums[mid]) {
				left = mid+1;
			}
		}
		if(nums[left] == key) {
			return left;
		}
		return -1;
		
	}

情景三：查找最后一个值等于给定值的元素的下标(nums数组有重复数据)

/**
	 * 情景三：查找最后一个值等于给定值的元素的下标(nums数组有重复数据)
	 * 
	 * @param nums
	 * @param key
	 * @return
	 */
	public int binarySearch3(int[] nums,int key) {
		int left = 0;
		int right = nums.length-1;
		while(left<=right) {
			int mid = left + ((right - left) >> 1);
			if(key <nums[mid]) {
				right = mid-1;
			}else if(key >nums[mid]){
				left = mid+1;
			}else {
				if(mid == nums.length-1 || nums[mid+1] != key) {
					return mid;
				}else {
					left = mid+1;
				}
				
				
			}
			
			
		}
		return -1;
		
	}

情景四:查找第一个大于等于给定值的元素(nums数组有重复数据)

/**
	 * 情景四:查找第一个大于等于给定值的元素(nums数组有重复数据)
	 * @param nums
	 * @param key
	 * @return
	 */
	public int binarySearch4(int[] nums,int key) {
		int left = 0;
		int right = nums.length-1;
		while(left <= right) {
			int mid = left + ((right - left) >> 1);
			if(key > nums[mid]) {
				left =mid+1;
			}else {
				if(mid ==0 || key > nums[mid-1] ) {
					return mid;
				}else {
					right = mid-1;
				}
			}
		}
		
		return -1;
	}

情景五：查找最后一个小于等于给定值的元素(nums数组有重复数据)

/**
	 * 情景五：查找最后一个小于等于给定值的元素(nums数组有重复数据)
	 * @param nums
	 * @param key
	 * @return
	 */
	public int binarySearch5(int[] nums,int key) {
		int left = 0;
		int right = nums.length-1;
		while(left <= right) {
			int mid = left + ((right - left) >> 1);
			if(nums[mid] > key) {
				right = mid-1;
			}else {
				if(mid == nums.length-1 || nums[mid+1] > key ) {
					return mid;
				}else {
					left = mid+1;
				}
				
				
			}
		
		}
		return -1;
	}