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.
排序之后中间那个就是。应该还有更好的方法-.-
class Solution {
public:
int majorityElement(vector<int> &num) {
sort(num.begin(),num.end());
int n=num.size();
return num[n/2];
}
};