leetcode 169

import java.util.*;public class Solution {    public int majorityElement(int[] nums) {         HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();int key=0;if(nums.length==1)    return nums[0];for(int i=0;i<nums.length;i++){if(!(hm.containsKey(nums[i]))){hm.put(nums[i],1);//key=nums[i];}else{int value=hm.get(nums[i])+1;if(value>(nums.length/2))return nums[i];elsehm.put(nums[i],value);}}return key;    }}class Test169 {public static void main(String[] args) {Solution s=new Solution();int[] nums={1,2,3,4,1,1,1,1,1,3,3,3,3,3,3,3,3,3,3,3,3};System.out.println(s.majorityElement(nums));}}