[Algorithm/Java] dev matching 로또의 최고순위와 최저순위

class Solution {
    public int[] solution(int[] lottos, int[] win_nums) {

        int[] score = new int[]{6,6,5,4,3,2,1};
        
        int min = 0;
        int zCnt=0;
        
        for( int lotto : lottos ){
            if( lotto == 0) zCnt++;
            else {
                for ( int win : win_nums){
                    if(lotto == win) {
                        min++;
                        break;
                    }
                }
            }
        }
        
        int[] answer = {score[zCnt+min],score[min]};
        return answer;
    }
}