我的LeetCode代码仓:https://github.com/617076674/LeetCode
原题链接:https://leetcode-cn.com/problems/majority-element-ii/description/
题目描述:
知识点:
思路一:用哈希表记录各个数字出现的次数
时间复杂度和空间复杂度均是O(n),其中n为数组的长度。
JAVA代码:
public class Solution {
public List<Integer> majorityElement(int[] nums) {
List<Integer> result = new ArrayList<>();
HashMap<Integer, Integer> hashMap = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if(hashMap.containsKey(nums[i])){
hashMap.put(nums[i], hashMap.get(nums[i]) + 1);
}else{
hashMap.put(nums[i], 1);
}
}
for(Integer integer : hashMap.keySet()){
if(hashMap.get(integer) > nums.length / 3){
result.add(integer);
}
}
return result;
}
}
LeetCode解题报告:
思路二:Boyer–Moore majority vote algorithm
题目要找的数要求出现次数大于n / 3(向下取整)次,因此不会多于2个数,即满足条件的数至多只有2个。我们只需找出出现次数最多的两个数,并判断其出现次数是否大于n / 3(向下取整)次即可。
时间复杂度是O(n),其中n为数组的长度。空间复杂度是O(1)。
JAVA代码:
public class Solution {
public List<Integer> majorityElement(int[] nums) {
List<Integer> result = new ArrayList<>();
if(nums.length == 0){
return result;
}
int number1 = nums[0], count1 = 0, number2 = nums[0], count2 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == number1) {
count1++;
}else if (nums[i] == number2) {
count2++;
}else if (count1 == 0) {
number1 = nums[i];
count1 = 1;
}else if (count2 == 0) {
number2 = nums[i];
count2 = 1;
}else {
count1--;
count2--;
}
}
count1 = 0;
count2 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == number1) {
count1++;
} else if (nums[i] == number2) {
count2++;
}
}
if (count1 > nums.length / 3){
result.add(number1);
}
if (count2 > nums.length / 3) {
result.add(number2);
}
return result;
}
}
LeetCode解题报告: