Leetcode #169

gistfile1.txt

import java.util.Hashtable;
public class Solution {
    public int majorityElement(int[] num) {
        Hashtable<Integer,Integer> count = new Hashtable<Integer, Integer>();
        int len = num.length;
        int curr;
        for(int i=0; i<len; i++){
            curr = num[i];
            if(count.containsKey(curr)){
                int temp = count.get(curr);
                if(temp+1>len/2)
                    return curr;
                else
                    count.put(curr,temp+1);
            } else if(1 >len/2)
                     return curr;
                    else count.put(curr,1);
        }
        return Integer.MAX_VALUE;
    }
}