例如数组int a[]={1,2,2,3,3,3,4,5,5,6};1出现1次,2出现2次,3出现3次,4出现1次,5出现2次,6出现一次。出现次数最多3次,数字为3。求怎么找到数组中出现次数最多的数呢???
#include<stdio.h> //法一 void plateau(int a[],int n) { int now=1,max=1,num=a[0],i=1; for(;i<n;++i) { if(a[i]==a[i-1]) now++; else now=1; if(max<now) { max=now; num=a[i]; } } printf("the number %d occured %d times!\n",num,max); } //法二 void plateau(int a[],int n) { int length=1; for(int i=1;i<n;++i) { if(a[i]==a[i-length]) length++; } printf("the number occured %d times!\n",length); } int main() { int a[]={1,2,2,3,3,3,4,5,5,6}; int n=sizeof(a)/sizeof(int); plateau(a,n); }