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.

题目解释:查找出现在数组中出现次数多于n/2的，假设数组不为空且一定存在出现次数多于n/2的

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

简单想来就是排序之后数组一半处的元素一定是该符合条件的元素。