[LeetCode]Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times.

You may assume that the array is non-empty and the majority element always exist in the array.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

public class Solution {
    public int majorityElement(int[] num) {
        Map
  
    map = new HashMap<>();
        for(int i=0;i
   
     it = map.keySet().iterator(); while(it.hasNext()){ int val = it.next(); if(map.get(val)>num.length/2){ return val; } } return -1; } }