出现次数最多的整数
#include
int main() {
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int maxCount = 0;
int mostFrequentNumber;
for (int i = 0; i < n; i++) {
int count = 1;
for (int j = i + 1; j < n; j++) {
if (arr[i] == arr[j]) {
count++;
}
}
if (count > maxCount) {
maxCount = count;
mostFrequentNumber = arr[i];
}
}
printf("%d %d", mostFrequentNumber, maxCount);
return 0;
}
#include
int main() {
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int maxCount = 0;
int mostFrequentNumber;
for (int i = 0; i < n; i++) {
int count = 1;
for (int j = i + 1; j < n; j++) {
if (arr[i] == arr[j]) {
count++;
}
}
if (count > maxCount) {
maxCount = count;
mostFrequentNumber = arr[i];
}
}
printf("%d %d", mostFrequentNumber, maxCount);
return 0;
}
全部评论
相关推荐
06-02 15:53
阳光学院 Java 点赞 评论 收藏
分享
07-18 16:12
门头沟学院 Java 点赞 评论 收藏
分享