로또의 최고 순위와 최저 순위

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 count = 0;
        int i;
        
        Arrays.sort(lottos);
        
        for(i = lottos.length - 1; i >= 0 && lottos[i] > 0; i--){//i + 1이 0 개수
            for(int j = 0; j < win_nums.length; j++){
                if(lottos[i] == win_nums[j]){
                    count++;
                    break;
                }
            }
        }
        answer[0] = rank[count + i + 1];
        answer[1] = rank[count];
        
        return answer;
    }
}

Python

def solution(lottos, win_nums):
    answer = []
    rank = [6, 6, 5, 4, 3, 2, 1]
    count = 0
    
    for element in lottos:
        if element in win_nums:
            count += 1
    
    answer.append(rank[count + lottos.count(0)])
    answer.append(rank[count])
    
    return answer