LeetCode OJ 系列之169 Majority Element --Python

原创于 2015-11-24 09:06:41 发布 · 843 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Python #OJ

Python 同时被 2 个专栏收录

26 篇文章

订阅专栏

LeetCode

22 篇文章

订阅专栏

本文介绍了一种用于查找数组中出现次数超过一半的多数元素的方法。该算法通过遍历数组并使用字典记录每个元素出现的次数来实现。最终找到出现次数最多的元素作为多数元素返回。

Problem:

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.

Answer:

class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = {}
        for i in nums:
            if i not in result:
                result[i] = 0
            result[i] += 1
        big_most = nums[0]
        big_most_count = 0
        for key,value in result.items():
            if value >= big_most_count:
                big_most = key
                big_most_count = value
        return big_most