【leetcode】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

思路：当n不为1时，计算它的各位数平方和，判断是否已经出现过，如果出现过，说明将无限循环下去，所以返回false，如果没出现过，就继续求各位数平方和，直到最后等于1

public class Solution {
   public int getNumber(int n)
    {
        int sum = 0;
        while(n!=0)
        {
            sum+=(n%10)*(n%10);
            n/=10;
        }
        return sum;
    }
    public boolean isHappy(int n) {

        HashSet<Integer> set = new HashSet<Integer>();
        while(n!=1)
        {
            if(set.contains(n))
            {
                return false;
            }
            set.add(n);
            n = getNumber(n);
        }
        return true;
    }
}