[알고리즘문제풀기] 최댓값 만들기(1)

문제

내가 작성한 오답

import java.util.Arrays;
import java.util.Comparator;

class Solution {
    public int solution(int[] numbers) {
        int answer = 0;
        Integer[] re = Arrays.stream(numbers)
            .distinct()
            .boxed() // int -> Integer
            .sorted(Comparator.reverseOrder()) 
            .toArray(Integer[]::new); 
        answer = re[0]*re[1]; //알아서 다운캐스팅 됨
        return answer;
    }
}

 

내가 작성한 정답

import java.util.Arrays;
import java.util.Comparator;

class Solution {
    public int solution(int[] numbers) {
        int answer = 0;
        Integer[] re = Arrays.stream(numbers)
            .boxed() 
            .sorted(Comparator.reverseOrder()) 
            .toArray(Integer[]::new); 
        answer = re[0]*re[1];
        return answer;
    }
}

다른 사람들이 작성한 정답

import java.util.*;

class Solution {
    public int solution(int[] numbers) {
        int answer = 0;

        Arrays.sort(numbers);

        return numbers[numbers.length-1]*numbers[numbers.length-2];
    }
}