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.

https://leetcode.com/problems/majority-element/

import java.util.Hashtable;


public class Solution 
{

    public static int majorityElement(int[] num)
    {
        Hashtable<Integer,Integer> ht=new Hashtable();
        for(int i=0;i<num.length;i++)
        {
            if(ht.containsKey(num[i]))
                ht.put(num[i],ht.get(num[i])+1);
            else
                ht.put(num[i],1);
            if(ht.get(num[i])>=num.length/2)
                return num[i];    
        }
        return 0;
    }

    public static void main(String args[])
    {
        int[] num={6,5,5};
        System.out.println(majorityElement(num));
    }
}