思路:
1.快乐数可以用链表判断环实现
2.每个数字是链表的一个结点
3.运算一次,指向next
4.判断是否有环,有环则证明是快乐数
int next_num(int x){
int ret = 0,temp;
while(x){
temp = x % 10;
ret += temp *temp;
x /= 10;
}
return ret;
}
bool isHappy(int n) {
int p = n, q = n;
do{
p = next_num(p);
q = next_num(q);
q = next_num(q);
}while(p != q && q != 1);
return q == 1;
}