LeetCode202 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: 

       Input: 19

       Output: true

       Explanation:

       1^2 + 9^2 = 82

       8^2 + 2^2 = 68

       6^2 + 8^2 = 100

       1^2 + 0^2 + 0^2 = 1

public class HappyNumber {
    public boolean isHappy(int n) {
        if (n <= 0)
            return false;
        Map<Integer, Integer> map = new HashMap<>();

        int sum = getDigitaiSquareSum(n);

        map.put(sum, 1);

        while (true){
            if (sum == 1){
                return true;
            }else if(map.get(sum) > 1
            ){
                return false;
            }

            sum = getDigitaiSquareSum(sum);
            if (map.get(sum) == null)
                map.put(sum, 1);
            else
                map.put(sum, map.get(sum) + 1);
        }
    }

    public int getDigitaiSquareSum(int x){
        int sum = 0;
        while (x!=0){
            sum += Math.pow(x % 10, 2);
            x = x / 10;
        }
        return sum;
    }
    public static void main(String[] args) {
        System.out.println(new HappyNumber().isHappy(11));
    }
}

 LeetCode采用递归来解决此问题，耗时0ms

public class HappyNumber {
    public boolean isHappy(int n) {
        if (n <= 0)
            return false;
        while (true) {
            int sum = 0;
            while (n > 0) {
                int digit = n % 10;
                sum += digit * digit;
                n = n / 10;
            }
            if (sum == 1)
                return true;
            else if(sum==4)
                return false;
            else
                return isHappy(sum);
        }
    }

    public int getDigitaiSquareSum(int x){
        int sum = 0;
        while (x!=0){
            sum += Math.pow(x % 10, 2);
            x = x / 10;
        }
        return sum;
    }
    public static void main(String[] args) {
        System.out.println(new HappyNumber().isHappy(11));
    }
}