题解 | 数组中出现次数超过一半的数字

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param numbers int整型一维数组 
# @return int整型
#
class Solution:
    def MoreThanHalfNum_Solution(self , numbers: List[int]) -> int:
        # write code here
        hash = {}
        n = (len(numbers)-1)/2
        for i in range(len(numbers)):
            if numbers[i] not in hash:
                hash[numbers[i]]=1
            else:
                hash[numbers[i]]+=1
            if hash[numbers[i]]>n:
                return numbers[i]
        # # 根据字典的value进行排序
        # hash.sorted(key=lambda x :x[1])
        # return hash[-1][0]