class Solution {
public boolean isHappy(int n) {
Set<Integer> record = new HashSet<>();
while( n!=1 && !record.contains(n)){
record.add(n);
n = getNextNumber(n);
}
return n == 1;
}
private int getNextNumber(int n){
int res = 0;
while(n>0){
int temp =n%10;
res +=temp*temp;
n=n/10;
}
return res;
}
}
202. 快乐数 Java版
最新推荐文章于 2024-03-21 22:29:38 发布