169. Majority Element

Posted 2020-07-03 阿怪123

public class Solution {
    public int majorityElement(int[] nums) {
        Map<Integer,Integer> mp=new HashMap<Integer,Integer>();
        int len=nums.length;
        int res=0;
        if(len==1)
            return nums[0];
        for(int i=0;i<len;i++)
        {
            if(mp.containsKey(nums[i]))
            {
                if(mp.get(nums[i])>=len/2)
                {
                    res=nums[i];
                    break;
                }
                else
                    mp.put(nums[i],mp.get(nums[i])+1);
            }
            else
                mp.put(nums[i],1);
        }
        return res;
        
    }
}