leetcode169v2.cpp

//version 2: sorting
//时间复杂度 O(nlgn)

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        nth_element(nums.begin(), nums.begin() + nums.size() / 2, nums.end());
        return nums[nums.size() / 2];
    }
};