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

Credits:

Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.

hash的简单应用；使用Hash存储每个n值，看是否已经存在。

package leetcode;

import java.util.HashSet;

public class HappyNumber {

public boolean isHappy(int n) {

boolean ans = true;

        HashSet<Integer> nums = new HashSet<Integer>();

        int sum = 0;

        while (ans && n != 1){

        //System.out.println("n = "+n);

        while (n > 0){

        int t = n % 10;

            sum += t * t;

            n = n / 10;

        }

        if (nums.contains(sum)) ans = false;

        else nums.add(sum);

        n = sum;

        sum = 0;

        }

        return ans;

    }

public static void main(String[] args) {

// TODO Auto-generated method stub

System.out.println(new HappyNumber().isHappy(12));

}

}