题目描述:
示例 1:
示例 2:
示例 3:
思路:
代码实现:
class Solution {
public int majorityElement(int[] nums) {
int len = nums.length;
int num = nums[0];
int count = 1;
for (int i = 1; i < len; i++) {
if (count == 0) {
num = nums[i];
}
if (num == nums[i]) {
count++;
} else {
count--;
}
}
count = 0;
for (int i = 0; i < len; i++) {
if (num == nums[i]) {
count++;
}
}
if (count <= len / 2) {
return -1;
}
return num;
}
}