169. 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.

找到数组中出现多余一半的数，假设数组非空且必定存在这样的数

思路以下，排序后最中间的数必定是出现超过一半的那个数

    public int majorityElement(int[] nums) {
        Arrays.sort(nums);
        return nums[nums.length/2];
    }