LeetCode作业Majority Element

最新推荐文章于 2017-06-19 16:08:41 发布

勺月

最新推荐文章于 2017-06-19 16:08:41 发布

阅读量201

点赞数

分类专栏：算法应用作业文章标签： leetcode 算法设计

本文链接：https://blog.csdn.net/sinat_37607788/article/details/60334425

版权

算法应用作业专栏收录该内容

34 篇文章 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:
int majorityElement(vector<int> &num) {

        int elem = 0;
        int count = 0;

        for(int i = 0; i < num.size(); i++) {

            if(count == 0) {
                elem = num[i];
                count = 1;
            }
            else    {
                if(elem == num[i])
                    count++;
                else
                    count--;
            }

        }
        return elem;
    }

};