题意：数组长度为N，找出数组中元素出现个数大于N/2 的元素
public class Solution {
public int majorityElement(int[] num) {
int major=num[0], count = 1;
for(int i=1; i<num.length;i++){
if(count==0){
count++;
major=num[i];
}else if(major==num[i]){
count++;
}else count--;
}
return major;
}
}
leetcode 169. Majority Element
原文：http://www.cnblogs.com/sxy-798013203/p/7658906.html