# -*- coding:utf-8 -*-
class Solution:
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        numbers.sort()
        lth=len(numbers)
        if lth==1:
            return numbers[0]
        if numbers.count(numbers[lth//2])>lth/2:
            return numbers[lth//2]
        return 0
数量超过数组长度一半的数字排序后必定占据中间位置