三种二分法(中间，左边界，右边界)

最新推荐文章于 2022-05-28 16:58:33 发布

LiaoJiaYin

最新推荐文章于 2022-05-28 16:58:33 发布

阅读量286

点赞数 1

分类专栏：算法文章标签：二分法算法 java

本文链接：https://blog.csdn.net/A2254536570/article/details/117886517

版权

算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

随便找一个

    public static int binarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<=right) {
			int m=left+(right-left)/2;
			if(arr[m]==key)
				return m;
			else if(arr[m]>key)
				right=m-1;
			else
				left=m+1;
		}
		return -1;
	}

找左边界

	public static int leftBinarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<right) {
			int m=left+(right-left)/2;
			if(arr[m]>=key)
				right=m;
			else
				left=m+1;
		}
		return left;
	}

找右边界

	public static int rightBinarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<right) {
			int m=left+(right-left)/2;
			if(arr[m]<=key)
				left=m;
			else
				right=m-1;
		}
		return right;
	}

测试

public class 三种2分法 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] arr= {1,3,4,6,6,6,6,7,8,9};
		System.out.println(binarySearch(arr,6));
		System.out.println(leftBinarySearch(arr,6));
		System.out.println(rightBinarySearch(arr,6));
	}
	
	public static int binarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<=right) {
			int m=left+(right-left)/2;
			if(arr[m]==key)
				return m;
			else if(arr[m]>key)
				right=m-1;
			else
				left=m+1;
		}
		return left;
	}
    //用于寻找左边界，且key必定在arr中
	public static int leftBinarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<right) {
			int m=left+(right-left)/2;
			if(arr[m]>=key)
				right=m;
			else
				left=m+1;
		}
		return left;
	}
	//用于寻找右边界，且key必定在arr中
	public static int rightBinarySearch(int[] arr,int key) {
		int left=0,right=arr.length-1;
		while(left<right) {
			int m=left+(right-left+1)/2; //向上取整
			if(arr[m]<=key)
				left=m;
			else
				right=m-1;
		}
		return right;
	}
}