有没有办法在排序数组中同时包含lower_bound和upper_bound？

def lower_upper_bound(arr, target):
    left = 0
    right = len(arr) - 1
    lower = -1
    upper = -1

    # 查找lower_bound
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] >= target:
            lower = mid
            right = mid - 1
        else:
            left = mid + 1

    left = 0
    right = len(arr) - 1

    # 查找upper_bound
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] > target:
            upper = mid
            right = mid - 1
        else:
            left = mid + 1

    return lower, upper