leetcode | 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<=0)
            return false;
        else if(n==1)
            return true;
        else
        {
            Set<Integer> set = new HashSet<Integer>(); 
            set.add(n);
            while(true)
            {
                // System.out.println(n);
                if(digitSquare(n)==1)
                    return true;
                else
                {
                    n = digitSquare(n);
                    if(set.contains(n))
                        return false;
                    else
                        set.add(n);
                }
            }
        }
            
        
    }
    
    public int digitSquare(int n)
    {
        int sum = 0;
        int m = 0;
        while(n>0)
        {
            m = n%10;
            sum += m*m;
            n/=10;
        }
        return sum;
    }
}