Happy Number(Easy)

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

• ```java public boolean isHappy(int n) { HashSet set = new HashSet();

  while(!set.contains(n)){

    set.add(n);
  
    n = getSum(n);
  
    if(n==1)
        return true;
  

  }

  return false; }

public int getSum(int n){ int sum =0; while(n>0){ sum+=(n%10)*(n%10); n=n/10; } return sum;
} ```