
-Code
public class LeetCode268 {
// Missing Number
public int missingNumber(int[] nums) {
// 나온 숫자 체크
boolean[] checkNums = new boolean[nums.length + 1];
for (int num : nums) {
checkNums[num] = true;
}
// 나오지 않은 숫차 찾기
for (int i = 1; i <= checkNums.length; i++) {
if (!checkNums[i]) return i;
}
return 0;
}
}'알고리즘 문제 > Java' 카테고리의 다른 글
| [LeetCode/Java] Happy Number (0) | 2026.07.15 |
|---|---|
| [LeetCode/Java] Single Number (0) | 2026.07.14 |
| [LeetCode/Java] Backspace String Compare (0) | 2026.07.12 |
| [LeetCode/Java] Unique Morse Code Words (0) | 2026.07.11 |
| [LeetCode/Java] Flood Fill (0) | 2026.07.10 |