프로그래머스)체육복-Java

조건에 맞게 단계별로 풀이 합니다

class Solution {
public int solution(int n, int[] lost, int[] reserve) {
int answer = n;
int cnt=0;
answer = n-lost.length;

for(int i=0;i<lost.length;i++){
for(int j=0;j<reserve.length;j++){

if(lost[i]==reserve[j]){
cnt++;
lost[i]=-1;
reserve[j]=-1;
break;
}
}
}
for(int i=0;i<lost.length;i++){
for(int j=0;j<reserve.length;j++){

if(lost[i]==reserve[j]+1||lost[i]==reserve[j]-1){
cnt++;
reserve[j]=-1;
break;
}
}
}


answer=answer+cnt;
return answer;


}