public int majorityElement(int[] nums) {
int num = nums[0];
int vote = 1;
for (int i = 1; i < nums.length; ++i) {
if (vote == 0) {
num = nums[i];
}
if (nums[i] == num) {
vote++;
} else {
vote--;
}
}
return num;
}
LeetCode-Algorithms-[Easy][摩尔投票法]面试题39. 数组中出现次数超过一半的数字
猜你喜欢
转载自blog.csdn.net/m0_37302219/article/details/105630075
今日推荐
周排行