找到一个数组中的峰，另一个数组中的谷值，然后以交替的方式将它们连接起来，有什么有效的方法？

def find_peak_valley(arr1, arr2):
    peak = []
    valley = []
    result = []

    # 找到第一个数组中的峰值
    for i in range(1, len(arr1)-1):
        if arr1[i] > arr1[i-1] and arr1[i] > arr1[i+1]:
            peak.append(arr1[i])

    # 找到第二个数组中的谷值
    for i in range(1, len(arr2)-1):
        if arr2[i] < arr2[i-1] and arr2[i] < arr2[i+1]:
            valley.append(arr2[i])

    # 将峰值和谷值交替连接起来
    if len(peak) > len(valley):
        peak = peak[:len(valley)]
    elif len(valley) > len(peak):
        valley = valley[:len(peak)]

    for i in range(len(peak)):
        result.append(peak[i])
        result.append(valley[i])

    return result

# 示例用法
arr1 = [1, 3, 5, 4, 2]
arr2 = [6, 8, 7, 9, 10]
result = find_peak_valley(arr1, arr2)
print(result)