lintcode/leetcode由易至难第12题：Majority Element

Problem:

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.
Code:
public class Solution {
public int majorityElement(int[] nums) {
Arrays.sort(nums);
return nums[nums.length/2];
}
}