문제설명
입출력 예
풀이 및 후기
import java.util.Arrays;
class Solution {
public int solution(int n, int[] lost, int[] reserve) {
int answer = n-lost.length;
Arrays.sort(lost);
Arrays.sort(reserve);
int[] arr = new int[lost.length];
for (int i = 0; i < lost.length; i++) {
for (int j = 0; j < reserve.length; j++) {
if (lost[i] == reserve[j]) {
answer++;
lost[i] = reserve[j] = -1;
break;
}
}
}
for (int i = 0; i < lost.length; i++) {
for (int j = 0; j < reserve.length; j++) {
if (lost[i] -1 == reserve[j] || lost[i] +1 == reserve[j]) {
answer++;
reserve[j] =-1;
break;
}
}
}
return answer;
}
}