Majority Element 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
Constraints:
n == nums.length
1 <= n <= 5 * 104
-231 <= nums[i] <= 231 - 1
Majority Element Solutions
✅Time: O(n)
✅Space: O(1)
C++
class Solution {
public:
int majorityElement(vector<int>& nums) {
int ans;
int count = 0;
for (const int num : nums) {
if (count == 0)
ans = num;
count += num == ans ? 1 : -1;
}
return ans;
}
};
Java
class Solution {
public int majorityElement(int[] nums) {
Integer ans = null;
int count = 0;
for (final int num : nums) {
if (count == 0)
ans = num;
count += num == ans ? 1 : -1;
}
return ans;
}
}
Python
class Solution:
def majorityElement(self, nums: List[int]) -> int:
ans = None
count = 0
for num in nums:
if count == 0:
ans = num
count += (1 if num == ans else -1)
return ans
Watch Tutorial
Checkout more Solutions here