Sequence table - find main element

• Find the main element

Examples of kingcraft ： As efficient as possible , Find the main element

• Algorithmic thought

Because it is required to be as efficient as possible , So we use the time for space algorithm , Set up an auxiliary array , Its capacity is the maximum in the sequence , Count their appearance times , If it meets the requirements, output .

• Code implementation

#include<stdio.h>
#define MAXSIZE 100
int main(){
    
	// Find the main element  
	 int a[] ={
    0,3,3,3,3,7,5,5};
	 int temp[MAXSIZE];
	 int max=a[0];
	 int i;
	 for(i=0;i<9;i++){
    // Find the maximum value of the sequence 
	 	if(max<a[i])
	 	max=a[i];
	 }
	 printf("%d ",max);
	 for(i=0;i<max;i++){
    // Auxiliary array timer initialization 
		temp[i]=0;
	 }
	 for(i=0;i<9;i++){
    
	 	temp[a[i]]++;// Statistics 
	 }
	 int t=0;
	 for(i=0;i<max;i++){
    
	 	if(temp[i]>=n/2){
    
	 		 t=i;// Main element found 
	 		break;
		 } 
	}
	if(t!=0)// Output main element 
	printf("%d",t);
}