[leetcode-202]Happy Number(java)

问题描述：
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

分析：这道题描述的不清楚，它说start with any positive integer，实际上就是说的，一个整数的各个位的数字平方和相加。当出现1时，返回true，否则继续循环，那什么时候永远不会出现1，就是如果循环出现某个数字时，那就相当于构成一个环，那就永远不可能出现1.所以使用hashset来记录下出现的数字。

代码如下：248ms

public class Solution {
    public boolean isHappy(int n) {
        HashSet<Integer> sets = new HashSet<>();

        while(n!=1){
            if(sets.contains(n))
                break;
            sets.add(n);

            int newN=0;
            while(n!=0){
                int val = n%10;
                newN+=val*val;
                n /= 10;
            }
            n = newN;
        }
        if(n==1)
            return true;
        return false;
    }
}