소스코드
Map<Integer, Integer> counterMap = new HashMap<Integer, Integer>();
for(int i = 0 ; i < A.length ; i ++){
if(!counterMap.containsKey(A[i])){
counterMap.put(A[i], 1);
}
else{
if( (counterMap.get(A[i]) + 1) % 2 == 0 ){
counterMap.remove(A[i]);
}
else{
counterMap.put(A[i], counterMap.get(A[i]) + 1);
}
}
}
int result = 0;
Iterator<Integer> keys = counterMap.keySet().iterator();
while( keys.hasNext() ){
Integer key = keys.next();
result = key;
}
return result;
'공부-codility' 카테고리의 다른 글
[Lesson] 3. TapeEquilibrium (0) | 2022.08.04 |
---|---|
[Lesson] 3. PermMissionElem (0) | 2022.08.04 |
[Lesson] 3. FrogJmp (0) | 2022.08.04 |
[Lesson] 2. Arrays - CyclicRotation (0) | 2022.08.04 |
[Lesson] 1. Iterations (0) | 2022.08.04 |