mc_c.py

def solution(items):
    if not items:
        return

    count = 0
    best = None

    for n in items:
        if count == 0:
            best = n
            count += 1
        else:
            if n == best:
                count += 1
            else:
                count -= 1

    if count < 1:
        return

    count = 0
    for item in items:
        if item == best:
            count += 1

    if count > len(items) // 2:
        return best