
给定一个int元素的数组,任务是将元素按降序排列并找出它们的出现次数。
Input : arr[]={1,1,1,2,2,2,3,3,4,5,6,7,7}
Output : 7 occurs: 2
6 occurs: 1
5 occurs: 1
4 occurs: 1
3 occurs: 2
2 occurs: 3
1 occurs: 3
算法
START Step 1 -> input array with elements in sorting order Step 2 -> calculate size of an array by sizeof(a)/sizeof(a[0] Step 3 -> store size in a variable say en Step 4 -> Loop For i=siz-1 and i>0 and i== IF a[i]!=a[i-1] Set to=en-1 Print a[i] and to Set en=i End Step 5 -> print a[0] and to STOP
Example
的中文翻译为:
2026年数字艺术字分层PSD素材适用于2026数字艺术字设计 本作品提供2026年数字艺术字分层PSD素材的图片会员免费下载,格式为PSD,文件大小为13.2M; 请使用软件Photoshop进行编辑,作品中文字及图均可以通过软件修改和编辑;
示例
#include<stdio.h>
int main() {
int a[]={1,1,1,2,2,2,3,3,4,5,6,7,7};
int siz,i,en,st,to;
siz=sizeof(a)/sizeof(a[0]);
en=siz;
for(i=siz-1;i>0;i--) {
if(a[i]!=a[i-1]) {
to=en-i;
printf("%d occurs: %d<p>",a[i],to);
en=i;
}
}
to=en;
printf("%d occurs: %d</p>
<p>",a[0],to);
}</p></stdio.h>
输出
如果我们运行上述程序,它将生成以下输出
7 occurs: 2 6 occurs: 1 5 occurs: 1 4 occurs: 1 3 occurs: 2 2 occurs: 3 1 occurs: 3










