
-Code
class Solution {
public int[] findErrorNums(int[] nums) {
int[] numCnt = new int[nums.length + 1];
int[] answer = new int[2];
for (int num : nums) {
numCnt[num]++;
}
for (int i = 1; i <= nums.length; i++) {
if (numCnt[i] == 2) answer[0] = i;
if (numCnt[i] == 0) answer[1] = i;
}
return answer;
}
}
'Beakjoon&프로그래머스 > Java' 카테고리의 다른 글
| [LeetCode/Java] Find All Numbers Disappeared in an Array (0) | 2025.11.24 |
|---|---|
| [LeetCode/Java] How Many Numbers Are Smaller Than the Current Number (0) | 2025.11.24 |
| [LeetCode/Java] Max Consecutive Ones (0) | 2025.11.24 |
| [LeetCode/Java] Shuffle the Array (0) | 2025.11.24 |
| [LeetCode/Java] Concatenation of Array (0) | 2025.11.24 |