LeetCode--169. Majority Element (Divide-and-Conquer)

最新推荐文章于 2022-06-04 19:13:35 发布

ugt278

最新推荐文章于 2022-06-04 19:13:35 发布

阅读量270

点赞数

分类专栏： LeetCode 文章标签：分治算法 LeetCode Majority Element

本文链接：https://blog.csdn.net/ugt278/article/details/77923908

版权

LeetCode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

`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.

采用分治算法 (Divide-and-Conquer algorithms)

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        return Maj(nums, 0, nums.size() - 1);    
    }
private:
    int Maj(vector<int>& nums, int left, int right) {
        if (left == right) {
            return nums[left];
        }
        int mid = left + ((right - left) >> 1);
        int leftmaj = Maj(nums, left, mid);
        int rightmaj = Maj(nums, mid + 1, right);
        if (leftmaj == rightmaj) {
            return leftmaj;
        }
        return count(nums.begin() + left, nums.begin() + right + 1, leftmaj) > count(nums.begin() + left, nums.begin() + right + 1, rightmaj) ? leftmaj : rightmaj;
    }
};