169.Majority Element

来自WHY42
Riguz（留言 | 贡献）2024年2月19日 (一) 14:01的版本 （创建页面，内容为“=Description= {{LeetCode |id=majority-elemen |no=169 |difficulty=Easy |category=Array |collection=Top 150 |title=Majority Element |summary=Given an array nums of size n, return the majority element..}} The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1: <syntaxhighlight lang="bash"> Input: nums = [3,2,3] Output: 3 </syntaxhighlight> Example 2: <syntaxhi…”）
(差异) ←上一版本 | 最后版本 (差异) | 下一版本→ (差异)

Description

#169 Majority Element Easy
Array Top 150
Given an array nums of size n, return the majority element..

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Example 1: 

Input: nums = [3,2,3]
Output: 3

Example 2: 

Input: nums = [2,2,1,1,1,2,2]
Output: 2
检索自“https://riguz.com/index.php?title=169.Majority_Element&oldid=4129”