LeetCode binary search template

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

	
public static int leftBound(int[] array, int target) {
	int left = 0, right = array.length - 1;
	while (left < right) {
		int mid = left + (right - left) / 2;
		if (array[mid] < target) {
			left = mid + 1;
		} else {
			right = mid;
		}
	}
	return array[right] == target ? right : -1;
}
	
public static int rightBound(int[] array, int target) {
	int left = 0, right = array.length - 1;
	while (left + 1 < right) {
		int mid = left + (right - left) / 2;
		if (array[mid] > target) {
			right = mid - 1;
		} else {
			left = mid;
		}
	}
	if (array[right] == target) {
		return right;
	}
	if (array[left] == target) {
		return left;
	}
	return -1;
}