202. 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.

就是判断这个数的每个数位的平方求和，最后判断是否为一，如果是就是快乐数。。

但是还有一种数会变成死循环，所以不能用递归，将每一次求和后的数存入数组，每次循环前判断数组中是否有此数，如果有就跳出循环

class Solution {
    public boolean isHappy(int n) {
        if(n < 1){
            return false;
        }
        HashSet<Integer> test = new HashSet<>(32);
        int sum = 0;
        while(n != 1 && !test.contains(n))
        {
            test.add(n);
            sum = 0;
            while(n > 0)
            {
                sum +=Math.pow((n % 10), 2);
                n = n / 10;
            }
            n = sum;
        }
        return n == 1;
    }
}

太难了。。学渣想了一下午