169.Majority Element

Description

	#169	Majority Element	Easy
		Array	Top 150
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.

Example 1:

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

Example 2:

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

HashMap

Runtime 12ms		Memory 49.68MB

class Solution {
    public int majorityElement(int[] nums) {
        Map<Integer, Integer> counts = new HashMap<>();
        float half = nums.length / 2.0f;
        for(int i = 0; i < nums.length; i++) {
            int count = counts.getOrDefault(nums[i], 0) + 1;
            if(count > half) return nums[i];
            counts.put(nums[i], count);
        }
        throw new RuntimeException("No majority element found");
    }
}