leetcode解题方案--169--majority element

最新推荐文章于 2021-01-22 10:09:59 发布

笔筒谜语

最新推荐文章于 2021-01-22 10:09:59 发布

阅读量131

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sinat_16014143/article/details/78940336

版权

leetcode 专栏收录该内容

85 篇文章 0 订阅

订阅专栏

题目

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.

分析

排序取中间的值

另外一种方法叫摩尔选举

class Solution {
    public static int majorityElement(int[] nums) {
        Arrays.sort(nums);

        if (nums.length % 2 == 0) {
            if (nums.length <= 2) {
                return nums[0];
            } else {
                int first = nums[nums.length/2-1];
                if (first == nums[0]) {
                    return first;
                } else {
                    return nums[nums.length/2];
                }
            }

        } else {
            return nums[nums.length/2];
        }
    }
}