如何找到熊猫中重叠度最大的区间

def find_max_overlap_interval(intervals):
    intervals.sort(key=lambda x: x[0])  # 按照起始点进行排序
    max_overlap = 0
    max_overlap_interval = None

    for i in range(1, len(intervals)):
        if intervals[i][0] <= intervals[i-1][1]:  # 判断是否重叠
            overlap = min(intervals[i][1], intervals[i-1][1]) - intervals[i][0] + 1
            if overlap > max_overlap:  # 更新重叠度最大的区间
                max_overlap = overlap
                max_overlap_interval = (intervals[i-1], intervals[i])

    return max_overlap_interval

# 示例输入
intervals = [(1, 5), (3, 9), (6, 10), (8, 12), (11, 15)]
result = find_max_overlap_interval(intervals)
print("重叠度最大的区间：", result)