Leetcode刷题笔记(c++)_剑指 Offer 39. 数组中出现次数超过一半的数字

排序

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

双指针

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int n=nums.size();
        sort(nums.begin(),nums.end());
        int left=0,right=n-1;
        while(right>=left){
            if(nums[right]==nums[left])return nums[left];
            right--;
            left++;
        }
        return 0;
    }
};

哈希映射

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