问寻找一种算法，以在一个空数组的中间找到一组数据的开始和结束。

EN

def findData(A):
    if (len(A)<1):
        return None
    q = [(0,len(A))]
    pos = 0
    while pos < len(q):
        (s,e) = q[pos]
        pos += 1
        mid = s + (e-s)//2
        if A[mid] == None:
            # Didn't find data. Subdivide range
            if mid > s:
                q.append((s,mid))
            if mid+1 < e:
                q.append((mid+1,e))
            continue

        # Found data
        maxs = mid # max start pos
        mine = mid+1 # min end pos

        # Binary search to find start
        while s < maxs:
            mid = s + (maxs-s)//2
            if A[mid] == None:
                s = mid+1
            else:
                maxs = mid
        
        # Binary search to find end
        while mine < e:
            mid = mine + (e-mine)//2
            if A[mid] == None:
                e = mid
            else:
                mine = mid+1
        
        return(s,e)
    
    # Searched the whole array and found no data
    return None

$> print(findData([
    None,None,None,1,2,3,4,5,None
]))
(3,8)