HashSet 선언
HashSet<Integer> set = new HashSet<>();
HashSet -> Array 변환
answer = new int[set.size()]; for (int num : set) { answer[length++] = num; }
Array 정렬
Arrays.sort(answer);
import java.util.*;
class Solution {
public int[] solution(int[] numbers) {
int[] answer = {};
HashSet<Integer> set = new HashSet<>();
for (int i=0; i<numbers.length-1; i++) {
for (int j=i+1; j<numbers.length; j++) {
set.add(numbers[i]+numbers[j]);
}
}
int length = 0;
answer = new int[set.size()];
for (int num : set) {
answer[length++] = num;
}
Arrays.sort(answer);
return answer;
}
}