[문제]
[답안작성]
class Solution {
public int solution(int[] A) {
Set<Integer> tempSet = new HashSet<>();
for( int a : A ) {
if( tempSet.contains( a ) ) {
tempSet.remove(a);
}
else {
tempSet.add(a);
}
}
return tempSet.iterator().next();
}
}
[Codility] TapeEquilibrium (0) | 2020.06.28 |
---|---|
[Codility]PermMissingElem (0) | 2020.06.28 |
[Codility]FrogJmp (0) | 2020.06.27 |
[Codility]CyclicRotation (0) | 2020.06.27 |
[Codility]BinaryGap (0) | 2020.06.27 |
댓글 영역