Leetcode刷题笔记(c++)

class Solution {
public:
    int majorityElement(vector& nums) {
        unordered_maphashmap;
        for(int i:nums){
            hashmap[i]++;
            if(hashmap[i]>nums.size()/2)return i;
        }
        return 0;
    }
};

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