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  ~~~ public class Solution { public boolean isHappy(int n) { Set<Integer> numberSet = new HashSet<Integer>(); while (n!=1){ if (numberSet.add(n)==false){ return false; } char[] chars = String.valueOf(n).toCharArray(); int total = 0; for (Character ch: chars){ total += Math.pow(Integer.parseInt(ch+""),2); } n = total; } return true; } } //同計算循環小數一樣, 如果出現循環, 則無需繼續計算,直接返回false即可. //按照描述來做就可以了，把每位的平方累加，得到新數字，如果和為1則返回true，否則使用哈希來存已經計算過的數字。如果已經在哈希中存//在，返回false。 ~~~