LeetCode-169. Majority Element

最新推荐文章于 2017-06-01 17:27:42 发布

这个好玩吗

最新推荐文章于 2017-06-01 17:27:42 发布

阅读量320

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/flx413/article/details/52954611

版权

LeetCode 专栏收录该内容

26 篇文章 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.

查找一个数组中出现次数大于 n / 2的元素。

我的做法是暴力，复杂度O(n^2)，能过。

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int ans;
        int len = nums.size();
        sort( nums.begin(), nums.end() );
        
        for( int i = 0; i < len; ) {
           int curNum = nums[i];
           int curCnt = 0;
           int temp = i;
           for( int j = i; j < len; j++ ) {
               if( nums[j] == curNum ) curCnt++;
               else {
                   i = j;
                   break;
               }
           }
           if( curCnt > len / 2 ) {
               ans = nums[temp];
               break;
           }
        }
        return ans;  
};

更快的做法：

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int nTimes = 0;
        int candidate = 0;
        for(int i = 0; i < nums.size(); i ++)
        {
            if(nTimes == 0)
            {
                candidate = nums[i];
                nTimes = 1;
            }
            else
            {
                if(candidate == nums[i])
                    nTimes ++;
                else
                    nTimes --;
            }
        }
        return candidate;
    }
};