Leetcode 169

最新推荐文章于 2021-03-10 14:36:59 发布

xm1991happy

最新推荐文章于 2021-03-10 14:36:59 发布

阅读量292

点赞数

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/xm1991happy/article/details/51013028

版权

Leetcode 专栏收录该内容

12 篇文章

订阅专栏

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:
    int majorityElement(vector<int>& nums) {
        int j=1,m,i,z;
        if(nums.size()==1 || nums.size()==2)
        return nums[0];
        else
        {
            sort(nums.begin(),nums.end());
            for(i=0;i<nums.size()-1;i++)
            {
                if(nums[i]==nums[i+1])
                j++;
                else
                {
                    if(j>(nums.size()/2))
                    return nums[i];
                    else
                    j=1;
                }
            }
            
            if(i=nums.size()-2)
            return nums[nums.size()-2];
        }
    }
};