Leetcode +169 Majority Element"/>
Leetcode +169 Majority Element
Leetcode +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.
Example 1:
Input: [3,2,3]
Output: 3
Example 2:
Input: [2,2,1,1,1,2,2]
Output: 2
来源:力扣(LeetCode)
链接:
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路解析
class Solution:def majorityElement(self, nums):counts = collections.Counter(nums)return max(counts.keys(), key=counts.get)
更多推荐
Leetcode +169 Majority Element
发布评论