
public static int solution(int[] numbers) {
int answer = 0;
Set<Integer> set = new HashSet<>();
for (int num : numbers) {
set.add(num);
}
List<Integer> missing = new ArrayList<>();
for (int i = 1; i <= 9; i++) {
if(!set.contains(i)) missing.add(i);
}
for (int integer : missing) {
answer += integer;
}
return answer;
}
public static int solution(int[] numbers) {
int answer = 45;
for (int number : numbers) {
answer -= number;
}
return answer;
}