Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

최빈값 구하기 #387

Closed
Tracked by #297
fkdl0048 opened this issue Nov 15, 2024 · 0 comments
Closed
Tracked by #297

최빈값 구하기 #387

fkdl0048 opened this issue Nov 15, 2024 · 0 comments
Assignees
Milestone

Comments

@fkdl0048
Copy link
Owner

fkdl0048 commented Nov 15, 2024

#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

int solution(vector<int> array) {
    unordered_map<int, int> freq_map;

    for (int num : array) {
        freq_map[num]++;
    }

    int max_freq = 0;        
    int mode = -1;           
    bool is_unique = true;

    for (const auto& pair : freq_map) {
        if (pair.second > max_freq) {
            max_freq = pair.second;
            mode = pair.first;
            is_unique = true;
        } else if (pair.second == max_freq) {
            is_unique = false;
        }
    }

    return is_unique ? mode : -1;
}
@fkdl0048 fkdl0048 mentioned this issue Nov 15, 2024
98 tasks
@fkdl0048 fkdl0048 self-assigned this Nov 15, 2024
@fkdl0048 fkdl0048 added this to Todo Nov 15, 2024
@github-project-automation github-project-automation bot moved this to Todo in Todo Nov 15, 2024
@fkdl0048 fkdl0048 added this to the Programmers milestone Nov 15, 2024
@fkdl0048 fkdl0048 moved this from Todo to In Progress in Todo Nov 26, 2024
@github-project-automation github-project-automation bot moved this from In Progress to Done in Todo Nov 26, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Archived in project
Development

No branches or pull requests

1 participant