• + 0 comments
    public static List<Integer> climbingLeaderboard(List<Integer> ranked, List<Integer> player) {
    
       ArrayList<Integer> list = new ArrayList<>(new TreeSet<>(ranked).descendingSet());
       List<Integer> answer = new ArrayList<Integer>();
       for(Integer x: player){
            int index = Collections.binarySearch(list, x, Collections.reverseOrder());
            if(index<0){
                index = Math.abs(index);
            }
            else{
                 index+=1;
            }
            answer.add(index);
       }
       return answer;
    }