[COS PRO 1급 기출문제 - Java] 1-8 누가 당선 되나요

edu.goorm.io/learn/lecture/17301/cos-pro-1%EA%B8%89-%EA%B8%B0%EC%B6%9C%EB%AC%B8%EC%A0%9C-java/lesson/839402/1%EC%B0%A8-%EB%AC%B8%EC%A0%9C8-%EB%88%84%EA%B0%80-%EB%8B%B9%EC%84%A0-%EB%90%98%EB%82%98%EC%9A%94-java

goorm

 

문제 유형

코드 수정하기

 

문제

import java.util.*;
 
class Main {
    
    public int[] solution(int N, int[] votes) {
        int voteCounter[] = new int[11];
        for (int i = 0; i < votes.length; i++) {
            voteCounter[votes[i]] += 1;
        }
        int maxVal = 0;
        int cnt = 0;
        for (int i = 1; i <= N; i++) {
            if (maxVal < voteCounter[i]) {
                maxVal = voteCounter[i];
                cnt = 1;
            }
            else if(maxVal == voteCounter[i]){
                cnt += 1;
            }
        }
        int answer[] = new int[cnt];
        for (int i = 1, idx = 0; i <= N; i++){
            if (voteCounter[i] == maxVal) {
                answer[idx] = voteCounter[i];
                idx += 1;
            }
        }
            Arrays.sort(answer);
        return answer;
    }
    
public static void main(String[] args) {
        Main sol = new Main();
        int N1 = 5;
        int[] votes1 = {1,5,4,3,2,5,2,5,5,4};
        int[] ret1 = sol.solution(N1, votes1);
 
        System.out.println("solution 함수의 반환 값은 " + Arrays.toString(ret1) + " 입니다.");
        
 
        int N2 = 4;
        int[] votes2 = {1, 3, 2, 3, 2};
        int[] ret2 = sol.solution(N2, votes2);
 
        System.out.println("solution 함수의 반환 값은 " + Arrays.toString(ret2) + " 입니다.");
    }
}
 

 

풀이

import java.util.*;
 
class Main {
    
    public int[] solution(int N, int[] votes) {
        int voteCounter[] = new int[11];
        for (int i = 0; i < votes.length; i++) {
            voteCounter[votes[i]] += 1;
        }
        int maxVal = 0;
        int cnt = 0;
        for (int i = 1; i <= N; i++) {
            if (maxVal < voteCounter[i]) {
                maxVal = voteCounter[i];
                cnt = 1;
            }
            else if(maxVal == voteCounter[i]){
                cnt += 1;
            }
        }
        int answer[] = new int[cnt];
        for (int i = 1, idx = 0; i <= N; i++){
            if (voteCounter[i] == maxVal) {
                answer[idx] = i;
                idx += 1;
            }
        }
            Arrays.sort(answer);
        return answer;
    }
    
public static void main(String[] args) {
        Main sol = new Main();
        int N1 = 5;
        int[] votes1 = {1,5,4,3,2,5,2,5,5,4};
        int[] ret1 = sol.solution(N1, votes1);
 
        System.out.println("solution 함수의 반환 값은 " + Arrays.toString(ret1) + " 입니다.");
        
 
        int N2 = 4;
        int[] votes2 = {1, 3, 2, 3, 2};
        int[] ret2 = sol.solution(N2, votes2);
 
        System.out.println("solution 함수의 반환 값은 " + Arrays.toString(ret2) + " 입니다.");
    }
}