如何修复片段重叠？

import hashlib

def calculate_hash(data):
    return hashlib.md5(data).hexdigest()

def detect_overlap(fragments):
    hashes = {}
    for i, fragment in enumerate(fragments):
        frag_hash = calculate_hash(fragment)
        if frag_hash in hashes:
            return True, (hashes[frag_hash], i)
        hashes[frag_hash] = i
    return False, None

def remove_overlap(fragments):
    new_fragments = []
    seen_hashes = set()
    for fragment in fragments:
        frag_hash = calculate_hash(fragment)
        if frag_hash not in seen_hashes:
            new_fragments.append(fragment)
            seen_hashes.add(frag_hash)
    return new_fragments

# 示例数据
fragments = [
    b"data1",
    b"data2",
    b"data1",  # 重叠片段
    b"data3"
]

# 检测重叠
has_overlap, overlap_indices = detect_overlap(fragments)
print(f"Has overlap: {has_overlap}, Overlap indices: {overlap_indices}")

# 去除重叠
new_fragments = remove_overlap(fragments)
print(f"New fragments: {new_fragments}")