169. Majority Element

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.

code1:

from operator import *
class Solution(object):
def majorityElement(self, nums):
    """
    :type nums: List[int]
    :rtype: int
    """

    dict1 = {}
    for i in range(len(nums)):
        dict1[nums[i]] = dict1.get(nums[i], 0) + 1
    dict1 = sorted(dict1.iteritems(), key = itemgetter(1), reverse = True)
    return dict1[0][0]

code2:
借鉴了Moore投票算法,速度较前者更快

class Solution:
def majorityElement(self, nums):
    candidate = None
    count = 0
    for e in nums:
        if count == 0: 
            candidate = e
            count = 1
        elif e == candidate:
            count += 1
        else:
            count -= 1
    return candidate
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值