class Solution {
public int majorityElement(int[] nums) {
int res = nums[0], count = 0;
for (int i = 0; i < nums.length; i++) {
if (res == nums[i]) {
count++;
} else {
count--;
}
if (count == 0) {
res = nums[i + 1];
}
}
return res;
}
}
摩尔投票,(同归于尽)