프로그래머스 lv1: 로또의 최고 순위와 최저 순위

 

import java.util.Arrays;

class Solution {
    public int[] solution(int[] lottos, int[] win_nums) {
        Arrays.sort(lottos);
        Arrays.sort(win_nums);

        int count = 0;
        int zeroCount = 0;
        int rank = 0;

        System.out.println("win_nums = " + Arrays.toString(win_nums));
        System.out.println("lottos = " + Arrays.toString(lottos));

        for (int i = 0; i < lottos.length; i++) {
            if (lottos[i] != 0) {
                for (int j = 0; j < win_nums.length; j++) {
                    if (lottos[i] == win_nums[j]) {
                        count++;
                    }
                }
            } else {
                zeroCount++;
            }


        }
        System.out.println("count = " + count);
        System.out.println("zeroCount = " + zeroCount);


        int[] answer = {countRanking(count + zeroCount),countRanking(count) };
        System.out.println("answer = " + Arrays.toString(answer));
        return answer;
    }

    private int countRanking(int score) {
        int rank = 6;
        switch (score) {
            case 6:
                rank = 1;
                break;
            case 5:
                rank = 2;
                break;
            case 4:
                rank = 3;
                break;
            case 3:
                rank = 4;
                break;
            case 2:
                rank = 5;
                break;
            default:
                break;
        }
        return rank;
    }
}

       너무 무식하게 풀었다..