public static boolean isHappy(int n) {
if(n <= 0) {
return false;
}
Set<Integer> set = new HashSet<>();
boolean res = true;
int x = n;
while(res) {
char[] digits = String.valueOf(x).toCharArray();
int sum = 0;
for (int i = 0; i < digits.length; i++) {
sum += Math.pow(digits[i]-'0',2);
}
if (sum == 1) {
break;
}
if (!set.add(sum)) {
res = false;
break;
}
x = sum;
}
return res;
}
202. Happy Number
最新推荐文章于 2025-05-07 22:39:22 发布