week18-leetcode #169MajorityElement

week18-leetcode #169MajorityElement

链接：https://leetcode.com/problems/majority-element/description/

Topics：分而治之

Question

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.

Solution

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        if (nums.size() == 1) {
            return nums[0];
        }
        vector<int> vec1(nums.begin(), nums.begin()+nums.size()/2);
        int me1 = majorityElement(vec1);

        vector<int> vec2(nums.begin()+nums.size()/2, nums.end());
        int me2 = majorityElement(vec2);

        if (me1 == me2) {
            return me1;
        } else {
            int countme1 = 0;
            int countme2 = 0;
            for (int i=0; i<nums.size(); ++i) {
                if (nums[i] == me1) {
                    countme1++;
                } else {
                    countme2++;
                }

            }
            return countme1 >= countme2 ? me1 : me2;//注意这里必须要有等号
        }
    }
};

思路：采用分而治之的方法，将数组拆成左右两边进行考虑，如果左半边的众数等于右半边的众数，那么显然这个数就是所有的众数。如果左半边的众数是a，右半边的众数是b，那么遍历一遍整个数组，看a和b的个数哪个更大就是众数。