[LeetCode]Happy Number

Write an algorithm to determine if a number is “happy”.

A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.

Example: 19 is a happy number

1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

这道题要求判断一个数是否是【幸福数】。
所谓幸福数，就是按照上述规则，依次求得数n各个位上的数字的平方和，若该和等于1，则n是幸福数；如果不等于1，则将该和赋给n，继续求平方和。直到判断出结果。

需要注意的是，若一个数是幸福数，则必定会出现和为1的结果，可以跳出循环。而如果一个数不是幸福数，则可能一直循环下去。所以要找出跳出循环的条件：可以发现，当平方和等于不为1的一个数（0,2——9）时，就可以跳出循环，作出不是幸福数的判断。

class Solution {
public:
   bool isHappy(int n) {
        int ans = 0;
        while (true){
            while (n){
                ans += pow(n % 10, 2);
                n /= 10;
            }
            if (ans == 1)
                return true;
            else if (ans / 10 == 0)
                return false;
            else{
                n = ans;
                ans = 0;
            }
        }
    }
};