leetcode [#169]

目录

• 1. 题目
• 2. 解决方案
• 3. 注意事项

题目

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

---

注意事项

1. 将数组排序，返回下标为 N/2 的元素即可。