순위

import java.util.*;

class Solution {
    int compete[] ;
    public int solution(int n, int[][] results) {
        int answer = 0;
        compete = new int[n+1];
        for(int i=1; i<compete.length; i++){
            boolean visited[] = new boolean[compete.length];
            visited[i]=true;
            //나에게 진 친구들
            findLoser(i, i, visited, results);
            //나를 이긴 친구들
            findWinner(i, i, visited, results);
        }
        for(int i=1; i<compete.length; i++){
            if(compete[i]==n-1){
                answer++;
            }
        }
        return answer;
    }
    
    public void findLoser(int origin, int cur, boolean visited[],  int[][] results){
        for(int i=0; i<results.length; i++){
            if(results[i][0]==cur && !visited[results[i][1]]){
                compete[origin]++;
                visited[results[i][1]]= true;
                findLoser(origin, results[i][1], visited, results);
            }
        }
    }
    
    public void findWinner(int origin, int cur, boolean visited[],  int[][] results){
        for(int i=0; i<results.length; i++){
            if(results[i][1]==cur && !visited[results[i][0]]){
                compete[origin]++;
                visited[results[i][0]]= true;
                findWinner(origin, results[i][0], visited, results);
            }
        }
    }
}