int const n = 11;
int ary_1[n] = { 1, 2, 2, 3, 3, 4, 5, 6, 7, 7,7 };
int ary_2[n] = {0};
for (int i = 0; i < n; i++){
ary_2[ary_1[i]]++;
}
for (int i = 0; i < n; i++){
printf("%d", ary_2[i]);
if (ary_2[i]){
printf("%d出现%d次\n", i, ary_2[i]);
}
}
寻找数组元素在数组里面出现的个数
最新推荐文章于 2023-11-23 09:26:35 发布