169. Majority Element

来源:互联网 发布:机房网络拓扑结标注 编辑:程序博客网 时间:2024/05/23 16:24

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

class Solution(object):    def majorityElement(self, nums):        """        :type nums: List[int]        :rtype: int        """        a=0        b=0        for i in nums:            if b==0:                a=i                b=1            else:                if a==i:                    b+=1                else:                    b-=1        return a



0 0