题目链接
//: # (支持粘贴图片啦🎉🎉🎉)
//: # (保存的笔记可以在 CodeTop 微信小程序中查看)
java
class Solution {
public int majorityElement(int[] nums) {
int candidate = nums[0];
int count = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != candidate) {
count--;
} else {
count++;
}
if (count == 0) {
candidate = nums[i];
count++;
}
}
return candidate;
}
}
小结:秒了!!!