问在由1和0组成的python数组中找到1s组的中间点的最佳方法是什么？

EN

import numpy as np
array = [1,0,0,0,1,1,1,0,0,1,1,1,1,1,1,0,0,1]

#padding the array with 0 to ensure that first and last elements are not neglected 
arr = np.asarray([0] + array + [0])
#finding borders between 0 and 1
arr_diff = np.diff(arr)
#finding index values of first and last elements of each group of 1's
first = np.where(arr_diff == 1)[0]
last = np.where(arr_diff == -1)[0] - 1
#calculate the mean value of these indexes
ind = np.ceil(np.mean([first, last], axis=0)).astype(int)
print(ind)

[ 0  5 12 17]

def middlePoints(list):
    ones = False
    start = -1
    end = -1
    middle = []
    for index, item in enumerate([0] + list + [0]):
        if item == 1 and not ones:
            ones = True
            start = index - 1
        elif item == 0 and ones:
            ones = False
            end = index - 2
            middle.append((start + end) / 2)
            start = -1
            end = -1
    return middle

print(middlePoints([0,0,0,1,1,1,0,0,1,1,1,1,1,0,0])) # [4.0, 10.0]
print(middlePoints([0,0,0,1,1,1,0,0,1,1,1,1,0,0,0])) # [4.0, 9.5]

array = [0,0,0,1,1,1,0,0,1,1,1,1,1,0,0]

def middle_points(array):
    indexes = []
    first_one = -1
    for i in range(len(array)):
        if first_one == -1 and array[i] == 1:
            first_one = i 
        elif first_one > -1 and array[i] == 0:
            indexes.append((first_one+i-1)//2)
            first_one = -1
    if first_one > -1: 
        indexes.append((first_one+len(array)-1)//2)
    return indexes

print(middle_points(array)) #[4, 10]