Leetcode Everyday: 169. Majority Element

https://leetcode.com/problems/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[] nums) {
        Arrays.sort(nums);
        return nums[(nums.length-1)/2];
    }
}

public class Solution {
    public int majorityElement(int[] nums) {
        int major = nums[0]; int count = 1;
        for(int i = 1; i<nums.length; i++){
            if(count == 0) major = nums[i];
            if(nums[i]==major) count++;
            else count--;
        }
        return major;
    }
}

Because the major num occurs more than half of the length of the nums, this solution can always work.