[Lintcode]46. Majority Element/[Leetcode]169. Majority Element

最新推荐文章于 2025-03-31 22:10:03 发布

weixin_30340617

最新推荐文章于 2025-03-31 22:10:03 发布

阅读量108

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/siriusli/p/10359939.html

本文详细解析了LeetCode上编号169的题目——Majority Element的解决方案。该题目标是在给定整数数组中找到出现次数超过一半的多数元素。文章提供了Python实现的代码示例，采用排序算法确定多数元素，同时讨论了时间复杂度为nlog(n)的解决策略。

46. Majority Element/[169. Majority Element(https://leetcode.com/problems/majority-element/)

本题难度: Easy
Topic: Greedy

Description

Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it.

Example
Example1:
Given [1, 1, 1, 1, 2, 2, 2], return 1
Example2:
Given [1, 1, 1, 2, 2, 2, 2], return 2
Challenge
O(n) time and O(1) extra space

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

我的代码

class Solution:
    """
    @param: nums: a list of integers
    @return: find a  majority number
    """
    def majorityNumber(self, nums):
        # write your code here
        nums.sort()
        return nums[len(nums)//2]

思路

超过了1/2，所以最中间的元素肯定是决定最多元素

时间复杂度 nlog(n)

转载于:https://www.cnblogs.com/siriusli/p/10359939.html