二分-查找

二分查找

主方法

public static void main(String[] args) {
		int[] arr= {1,9,45,32,88,88,88,101};
         //System.out.println(search(arr, 88,0,arr.length-1));
         //System.out.println(search2(arr, 88,0,arr.length-1));
		System.out.println(searchMultiple(arr, 88, 0, arr.length-1));
}

递归

   /**
	 * 递归
	 * @param arr 查询数组
	 * @param target 查询目标
	 * @param left 左指针
	 * @param right 右指针
	 * @return
	 */
	public static int search(int[] arr,int target,int left,int right) {
		if (left>right) {
			return -1;
		}
		int mid=(left+right)/2;
		if (target>arr[mid]) {
			return search(arr, target, mid+1, right);
		}else if (target<arr[mid]) {
			return search(arr, target, left, mid-1);
		}else {
			return mid;
		}
	}

非递归

   /**
	 * 非递归写法
	 * @param arr 查询数组
	 * @param target 查询目标
	 * @param left 左指针
	 * @param right 右指针
	 * @return
	 */
	public static int search2(int[] arr,int target,int left,int right) {
		int mid=(left+right)/2;
		while (left<right) {
			if (target>arr[mid]) {
				return search2(arr, target, mid+1, right);
			}else if (target<arr[mid]) {
				return search2(arr, target, left, mid-1);
			}else {
				return mid;
			}
		}
		return -1;
	}

查找多个相同元素

  /**
	 * 查找多个相同元素
	 * @param arr 查询数组
	 * @param target 查询目标
	 * @param left 左指针
	 * @param right 右指针
	 * @return
	 */
	public static List<Integer> searchMultiple(int[] arr,int target,int left,int right) {
		int mid=(left+right)/2;
		while (left<right) {
			if (target>arr[mid]) {
				return searchMultiple(arr, target, mid+1, right);
			}else if (target<arr[mid]) {
				return searchMultiple(arr, target, left, mid-1);
			}else {
				List<Integer> list=new ArrayList<>();
				int l=mid-1,r=mid+1;
				while (target==arr[l] && l>=left) {
					list.add(l--);
				}
				list.add(mid);
				while (target==arr[r] && r<=right) {
					list.add(r++);
				}
				return list;
			}
		}
		return new ArrayList<>();
	}