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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Difficulty:Easy
两种程序分别用了两种不同的方法。
C++:
class Solution {
public:
int majorityElement(vector<int>& nums) {
int candidate = 0;
int count = 0;
for(int i = 0; i < nums.size(); i ++)
{
if(count == 0)
{
candidate = nums[i];
count = 1;
}
else
{
if(nums[i] == candidate)
count ++;
else
count --;
}
}
return candidate;
}
};
Python:
class Solution(object):
def majorityElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums)==1 or len(nums)==2:
return nums[0]
nums.sort()
return nums[len(nums)/2]