首页 > itarticle > 169. majority element

169. majority element

admin 11月 13, 2020 0

Easy

https://leetcode.com/problems/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.

Example 1:

1
2
 
Input: [3,2,3]
Output: 3

方法：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
class (object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)==1:
            return nums[0]
        cnt = 0
        ans = 0
        for i in range(len(nums)):
            if cnt==0:
                ans = nums[i]
                cnt += 1
            else:
                if nums[i]==ans:
                    cnt += 1
                else:
                    cnt -= 1
        return ans

类似题目：

229. Majority Element II

微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能