[Programmers/C++] 최빈값 구하기

출처

http://codingdojang.com/scode/612#answer-filter-area

/*
/*    
/*    khsh5592@naver.com
/*    has3ong.tistory.com
/*    
/*    2018 - 11 - 12
/*
*/
#include <stdio.h>
#include <conio.h>
#include <iostream>
 
using namespace std;
 
//int Check_Data[5] = {12, 17, 19, 17, 23}; //17
int Check_Data[5] = {26, 37, 26, 37, 91}; //26, 37
//int Check_Data[5] = {28, 30, 32, 34, 144}; // 없다.
 
typedef struct Select {
    int count;
    int Data;
    bool answer;
};
 
 
 
void Check_Array()
{
    Select S[5];
 
    int location = 0;
    int size = 0;
    int max = 0;
 
    for(int i = 0; i<5; i++)
    {
        S[i].count = 0;
        S[i].Data = 0;
        S[i].answer = false;
    }
 
    int count = sizeof(Check_Data) / sizeof(int);
 
    for(int i = 0; i< count; i++)
    {
        for(int j = 0; j<count; j++)
        {
            if(S[j].Data == Check_Data[i])
            {
                S[j].Data = Check_Data[i];
                S[j].count ++;
                S[j].answer = true;
                break;
            }
            else if ( j == count-1)
            {
                S[location].Data = Check_Data[i];
                S[location].count ++;
                S[location].answer = true;
                location++;
            }
        }
    }
 
    int check = 0;
    for(int i = 0; i<count; i++)
    {
        if(max <= S[i].count)
        {
            max = S[i].count;
            check ++;
        }
    }
 
    if(check == count)
    {
        cout<< " 없다. ";
        return;
    }
    else
    {
        for(int i = 0; i<count; i++)
        {
            if(max == S[i].count)
            {
                cout << " [ " << S[i].Data << " ] ";
            }
        }
    }
}
 
void main()
{
    Check_Array();
    getch();    
}