LeetCode--No.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

public class Solution {
    public int happy(int x){
            int y = 0;
            while(x > 0){
                int m = x % 10;
                y = y + m*m;
                x = x / 10;
            }
            return y;
    }
    public boolean isHappy(int n) {
        int m = n;
        List<Integer> list = new ArrayList<Integer>();
        while(1 > 0){
            list.add(m);
            m = happy(m);
            if(m == 1)
                return true;
            if(list.contains(m) == true)
                return false;
        }
    }
}

下面这段是别人写的，觉得也是不错的思路呢。

public class HappyNumber {
	public boolean isHappy(int n){
		HashSet<Integer> set = new HashSet<Integer>();
		while( n != 1 && !set.contains(n)){
			set.add(n);
			n = getNext(n);
		}
		return n==1;
	}
	private static int getNext(int m){
		int res = 0;
		while(m > 0){
			res += (m % 10) * (m % 10);
			m = m/10;
		}
		return res;
	}
}