
-Code
import java.util.*;
public class LeetCode202 {
// Happy Number
public boolean isHappy(int n) {
Set<Integer> set = new HashSet<>();
while (true) {
int sum = 0;
// 각 자리수 제곱의 합
for (char c : String.valueOf(n).toCharArray()) {
int num = c - '0';
sum += num * num;
}
n = sum;
// 나온 수면 탈출
if (set.contains(n)) break;
set.add(n);
}
return n == 1;
}
}'알고리즘 문제 > Java' 카테고리의 다른 글
| [LeetCode/Java] Single Number (0) | 2026.07.14 |
|---|---|
| [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 |
| [LeetCode/Java] Flood Fill (0) | 2026.07.10 |