202. Happy Number

Problem:

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: 

Input: 19
Output: true
Explanation: 
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

Analysis:

本题的思路比较简单，按照题意的思路直接模拟每次的计算过程，利用Set记录历史信息，一旦发现重复的元素则立马停止。代码如下：

Code:

class Solution {
    public boolean isHappy(int n) {
        if(n == 1)
            return true;
        Set<Integer> temp = new HashSet<Integer>();
        temp.add(n);
        while(true) {
            int sum = 0;
            while(n != 0) {
                sum =sum + (n%10) * (n%10);
                n/=10;
            }
            n = sum;
            if(temp.contains(n)) {
                break;
            } else {
                temp.add(n);
            }
        }
        if(n == 1)
            return true;
        return false;
    }
}