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.

Example: 19 is a happy number

• 12 + 92 = 82
• 82 + 22 = 68
• 62 + 82 = 100
• 12 + 02 + 02 = 1

我的/答案解法

public class Solution {
    public boolean isHappy(int n) {
        if(n == 1) return true;
        // 记录已经加入的数字
        HashSet<Integer> set = new HashSet<>();
        // 一旦新的平方和无法添加进去，则进入循环
        while(set.add(n)){
            int temp = 0;
            while(n != 0){
                temp += (n % 10) * (n % 10);
                n = n/10;
            }
            n = temp;
            // 不能通过n%10==0判断。因为1010%10==0，却不满足
            if(n == 1)
                return true;
        }
        return false;
    }
}