Programmers - 로또의 최고 순위와 최저 순위 (Java)

문제 링크

screenshot1 screenshot2 screenshot3 screenshot4

Java 풀이

import java.util.*;

class Solution {
    public int[] solution(int[] lottos, int[] win_nums) {
        int[] answer = new int[2];
        int[] rank = {6,6,5,4,3,2,1};
        
        int min = 0;
        int max = 0;
        for(int i = 0; i < lottos.length; i++){
            for(int j = 0; j < win_nums.length; j++){
                if( lottos[i] == win_nums[j] ) min++;
            }
            
            if( lottos[i] == 0 ) max++;
        }
        
        answer[0] = rank[min+max];
        answer[1] = rank[min];
        
        return answer;
    }
}