169. Majority Element

Posted 2020-10-13 lvbbg

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.

 

1 class Solution {
2 public:
3     int majorityElement(vector<int>& nums) {
4         sort(nums.begin(), nums.end());
5         return nums[nums.size() / 2];
6     }
7 };