leetcode--Happy Number

题目：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

One:  函数形式--最后为1返回true——为循环设置HashSet——为无穷大返回true

public class Solution {
    public boolean isHappy(int n) {
        if(n <= 0){return false;}
        long ln = n;
        Set<Long> set = new HashSet<Long>();
        
        while(ln<=Integer.MAX_VALUE){
            if(set.contains(ln))return false;else set.add(ln);
            ln = digitSquare(ln);
            if(ln==1) return true;
        }
        return false;
    }
    public long digitSquare(long ln){
        long sum = 0;
        while(ln!=0){
            sum += Math.pow(ln%10,2);
            ln /= 10;
        }
        return sum;
    }
}

Two：循环形式--双while

public class Solution {
    public boolean isHappy(int n) {
        HashSet<Integer> set = new HashSet<Integer>();
        set.add(n);
        while (n != 1) {
            int result = 0;
            while (n != 0) {
                result += Math.pow(n % 10, 2);
                n /= 10;
            }
            if (set.contains(result)) {
                return false;
            }
            set.add(result);
            n = result;
        }
        return true;
    }
}

Three：进一步简化  set.add作为循环条件

public boolean isHappy(int n) {
    Set<Integer> inLoop = new HashSet<Integer>();
    int squareSum,remain;
	while (inLoop.add(n)) {
		squareSum = 0;
		while (n > 0) {
		    remain = n%10;
			squareSum += remain*remain;
			n /= 10;
		}
		if (squareSum == 1)
			return true;
		else
			n = squareSum;

	}
	return false;

}