[LeetCode]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 位置上的那一个就是结果啦

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