输入一组无序的整数,编程输出其中出现次数最多的整数及其出现次数。java
时间: 2023-10-30 20:09:45 浏览: 49
可以使用HashMap来统计每个整数出现的次数,然后遍历HashMap找到出现次数最多的整数及其出现次数。
代码示例:
```
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = scanner.nextInt();
}
Map<Integer, Integer> map = new HashMap<>();
for (int num : nums) {
map.put(num, map.getOrDefault(num, 0) + 1);
}
int maxNum = nums[0];
int maxCount = 1;
for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
int num = entry.getKey();
int count = entry.getValue();
if (count > maxCount || (count == maxCount && num < maxNum)) {
maxNum = num;
maxCount = count;
}
}
System.out.println(maxNum + " " + maxCount);
}
}
```