Marjority Element

为什么80%的码农都做不了架构师？>>>   

题目

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.

思路

• 每遇到一个重复的元素就给计数加一，否则减一
• 计数到0的时候应该重置纪录元素

代码

class Solution:
    # @param num, a list of integers
    # @return an integer
    def majorityElement(self, num):
        cur = num[0]
        count = 0
        for i in num:
            if not i == cur:
                if count != 0:
                    count -= 1
                else:
                    cur = i
                    count = 1
                pass
            else:
                count += 1
                pass
        return cur

转载于:https://my.oschina.net/zuoyc/blog/363488