题目链接: LeetCode 169 — Majority Element
AC代码:
public class Problem169 {
public int majorityElement(int[] nums) {
int m=nums[0],n=0;
for(int i=0;i<nums.length;i++){
if(nums[i]==m)
n++;
else{
if(n>0)
n--;
else{
m=nums[i];
n=1;
}
}
}
return m;
}
}