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.

 

package cn.magicdu;import java.util.HashMap;import java.util.Map;public class _169_Majority_Element {        /*public static void main(String[] args) {        _169_Majority_Element e=new _169_Majority_Element();        int arr[]={2,2,2,3,4,5,5,6,6,6,6,6,6,6,6};        System.out.println(e.majorityElement(arr));    }*/        public int majorityElement(int[] nums) {        Map
     
       map=new HashMap<>();        int size=nums.length;        for(int i=0;i
      
       size/2){                    return nums[i];            }        }        return 0;    }}