[Java]프로그래머스 Lv. 0 진료 순서 정하기

https://school.programmers.co.kr/learn/courses/30/lessons/120835

프로그래머스

나의 풀이

import java.util.*;

class Solution {
    public int[] solution(int[] emergency) {
        int[] tmp = new int[emergency.length];
        int[] answer = new int[emergency.length];

        System.arraycopy(emergency, 0, tmp, 0, emergency.length - 1 + 1);

        Arrays.sort(tmp);

        for(int i = 0; i <= emergency.length-1; i++) {
            for(int j = 0; j <= emergency.length-1; j++) {
                if(tmp[i] == emergency[j]) {
                    answer[j] = emergency.length-i;
                }
            }
        }
        return answer;
    }
}

다른 풀이

import java.util.Arrays;
import java.util.Comparator;
import java.util.stream.Collectors;

class Solution {
    public int[] solution(int[] e) {
        return Arrays.stream(e).map(i -> Arrays.stream(e).boxed().sorted(Comparator.reverseOrder()).collect(Collectors.toList()).indexOf(i) + 1).toArray();
    }
}

class Solution {
    public int[] solution(int[] emergency) {
        int[] answer = new int[emergency.length];

        for(int i = 0; i < answer.length; i++){
            if(answer[i] != 0){
                continue;
            }
            int idx = 1;
            for(int j = 0; j < answer.length; j++){
                if(emergency[i] < emergency[j]){
                    idx++;
                }
            }
            answer[i] = idx;
        }
        return answer;
    }
}