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.
每找出两个不同的element，则
成对删除。最终剩下的一定就是所求的。 可扩展到⌊ n/k ⌋的情况，每k个不同的element进行成对删除。
int majorityElement(int* nums, int numsSize) {
int times = 1;
int target = nums[0];
for(int i = 1; i < numsSize; i++)
{
if(target == nums[i])
times++;
else
{
times--;
if(times == 0)
{
target = nums[++i];
times = 1;
}
}
}
return target;
}
Majority Element
原文：http://www.cnblogs.com/dylqt/p/5587385.html
