LeetCode - 169. Majority Element(Array, HashTable, Divide and Conquer, Sorting, Counting)*

Given an array nums of size n, return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

https://leetcode.com/problems/majority-element/

Example 1:

Input: nums = [3,2,3]
Output: 3

Example 2:

Input: nums = [2,2,1,1,1,2,2]
Output: 2

풀이

class Solution {
    public int majorityElement(int[] nums) {
        if(nums.length==1) return nums[0];
        
        Map<Integer, Integer> map = new HashMap<>();
        for(int i : nums){
           map.put(i, map.getOrDefault(i,0)+1);
            if(map.get(i)>nums.length/2){
                return i;
            } 
        }
        
        return 0;
    }
}