[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) {
        Arrays.sort(num);
        int count = 1;
        int len = num.length;
        int current = num[0];
        for (int i =1; i < len; i++) {
            if (num[i] == num[i-1]) {
                count++;
                if (count > len/2) return current;
                continue;
            }
            else {
                count = 1;
                current = num[i];
            }
        }
        return current;
    }
}