
-Code
import java.util.HashMap;
import java.util.Map;
public class LeetCode136 {
// Single Number
public int singleNumber(int[] nums) {
Map<Integer, Integer> numCnt = new HashMap<>();
for (int num : nums) {
numCnt.put(num, numCnt.getOrDefault(num, 0) + 1);
}
for (int num : numCnt.keySet()) {
if (numCnt.get(num) == 1) {
return num;
}
}
return -1;
}
}'알고리즘 문제 > Java' 카테고리의 다른 글
| [LeetCode/Java] Find the Difference (0) | 2026.07.16 |
|---|---|
| [LeetCode/Java] Happy Number (0) | 2026.07.15 |
| [LeetCode/Java] Missing Number (0) | 2026.07.13 |
| [LeetCode/Java] Backspace String Compare (0) | 2026.07.12 |
| [LeetCode/Java] Unique Morse Code Words (0) | 2026.07.11 |