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.

Input: 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

思路：
not a happy number: loop endlessly
如果一直循环下去势必出现重复
检查重复：hashset

class Solution {
    public boolean isHappy(int n) {
        //看看变化的过程中，是否出现重复，若出现，则代表不是快乐数
        Set<Integer> set=new HashSet<>();
        int sum;
        while(n!=1){
            sum=0;
            while(n>0){
                int a=n%10;
                sum=sum+a*a;
                n=n/10;
            }
            if(set.contains(sum)){
                return false;
            }
            set.add(sum);
            n=sum;
        }
        return true;
        
    }
}

Some tricks:
while循环取出个位数，十位数、百位数…

while(n>0){
	int a=n%10;
	sum=sum+a*a;
	n=n/10;
	}