剑指Offer 28. 数组中出现次数超过一半的数字 （数组）

# -*- coding:utf-8 -*-
class Solution:
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        if len(numbers) == 0:
            return 0
        # 思路1
        # dict = {}
        # for x in numbers:
        #     if x not in dict:
        #         dict[x] = 1
        #     else:
        #         dict[x] += 1
        # for key, val in dict.items():
        #     if val > len(numbers)//2:
        #         return key
        # return 0
        # 思路2
        result = numbers[0]
        time = 1
        for i in range(1,len(numbers)):
            if time == 0:
                result = numbers[i]
                time = 1
            elif numbers[i] == result:
                time += 1
            else:
                time -= 1
        # 判断result是否符合条件，即出现次数大于数组长度的一半
        time = 0
        for i in range(len(numbers)):
            if numbers[i] == result:
                time += 1
        if time > len(numbers)//2:
            return result
        else:
            return 0
if __name__ == ‘__main__‘:
    result = Solution().MoreThanHalfNum_Solution([1,2,3,2,2,2,5,4,2])
    print(result)