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

该题类似于编程之美中的《寻找发帖水王》问题，出现数目都是超过了总数的一半，解法相同。解法一参见 http://blog.csdn.net/will130/article/details/46005287

问题求解：

解法一：O(n) time O(1) space

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int n=nums.size();
        int candidate, nTimes;//数组中的数和次数
        for(int i=0, nTimes=0;i<n;i++)
        {
            if(nTimes==0)
            {
                candidate = nums[i], nTimes=1;
            }
            else
            {
                if(candidate == nums[i])
                {
                    nTimes++;
                }
                else
                {
                    nTimes--;
                }
            }
        }
        return candidate;
    }
};

解法二：O(n) time O(1) space

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int n=nums.size();
        int candidate=nums[0], nTimes=1;//数组中的数和次数
        for(int i=1;i<n;i++)
        {
            if(nums[i] == candidate)
            {
                nTimes++;
            }
            else
            {
                if(nTimes == 0)
                {
                    candidate = nums[i];
                    nTimes = 1;
                }
                else
                {
                    nTimes--;
                }
            }
        }
        return candidate;
    }
};