Skip to content

Instantly share code, notes, and snippets.

@dalcon10028
Last active July 7, 2020 04:38
Show Gist options
  • Save dalcon10028/aaba6034fa1f76e593df8055383f8cb9 to your computer and use it in GitHub Desktop.
Save dalcon10028/aaba6034fa1f76e593df8055383f8cb9 to your computer and use it in GitHub Desktop.
프로그래머스 코딩테스트 연습 Level-1 체육복 [ Java ]
import java.util.*;
class Solution {
public int solution(int n, int[] lost, int[] reserve) {
LinkedList<Integer> llLost = new LinkedList<>();
LinkedList<Integer> llReserve = new LinkedList<>();
Arrays.sort(lost);
Arrays.sort(reserve);
for (int i : lost) llLost.add(i);
for (int i : reserve) llReserve.add(i);
for(int i=0; i<llLost.size(); i++)
for(int j=0; j<llReserve.size(); j++)
if(llLost.get(i)==llReserve.get(j)){
llLost.remove(i);
llReserve.remove(j);
i--;
break;
}
for(int i=0; i<llReserve.size(); i++)
for(int j=0; j<llLost.size(); j++)
if(llReserve.get(i)-1 == llLost.get(j) || llReserve.get(i)+1 == llLost.get(j)){
llLost.remove(j);
break;
}
return n-llLost.size();
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment