class Solution {
public boolean isHappy(int n) {
Set<Integer> set = new HashSet<>();
while (true) {
int sum = 0;
char[] array = String.valueOf(n).toCharArray();
for (int i = 0; i < array.length; i++) {
int tmp = array[i] - '0';
sum = sum + tmp * tmp;
}
if (sum == 1) return true;
if (set.contains(sum)) return false;
n = sum;
set.add(n);
}
}
}
LeetCode:[202] 快乐数
最新推荐文章于 2024-07-25 23:26:35 发布