[leetcode]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.

Example: 19 is a happy number

• 12 + 92 = 82
• 82 + 22 = 68
• 62 + 82 = 100
• 12 + 02 + 02 = 1

代码（java）

1.

public class Solution {
    public boolean isHappy(int n) {
        int fast = n,slow = n;

//判断是否是Happy数 利用快慢指针问题 每次快指针走两步，慢指针走一步，如果是happy数，快指针会到1，如果不是
//会形成循环，快指针会被慢指针追上
        do{
            slow = sum(slow);
            fast = sum(fast);
            fast = sum(fast);
            if(fast == 1){return true;}
        }while(fast != slow);
        return false;
    }

//此方法求某个整数各个位数上数字的平方的和 并返回
    public static int sum(int n){
        int temp = 0, result = 0;
        while(n!=0){
            temp = n % 10;
            result += temp * temp;
            n = n/10;
        }
        return result;
    }
}

2.定义一个Set集合，一旦这个集合不能添加新的元素 （即该Set集合已经含有该元素，会形成循环，返回false,求得结果是1 ，就返回true，存在Happy Number）

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;

}