您的位置:首页 > 其它

169. Majority Element

2018-03-08 23:26 232 查看
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];
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode