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

用一个Map（Set）保存了出现过的数

public class Solution {
    public boolean isHappy(int n) {
        Map<Integer, Integer> m = new HashMap<>();
        while(m.getOrDefault(n, 0)==0){
            m.put(n, m.getOrDefault(n,0)+1);
            n = DigitSquareSum(n);
        }
        if(n==1) return true;
        else return false;
    }
    
    private int DigitSquareSum(int n){
        int sum = 0;
        while(n!=0){
            sum += Math.pow(n%10, 2);
            n /= 10;
        }
        return sum;
    }
}

不使用Set等存储已出现过数字的方法，C

int digitSquareSum(int n) {
        int sum = 0, tmp;
        while (n) {
            tmp = n % 10;
            sum += tmp * tmp;
            n /= 10;
        }
        return sum;
    }
    
    bool isHappy(int n) {
        int slow, fast;
        slow = fast = n;
        do {
            slow = digitSquareSum(slow);
            fast = digitSquareSum(fast);
            fast = digitSquareSum(fast);
            if(fast == 1) return 1;
        } while(slow != fast);
         return 0;
}

附上Floyd判圈法

http://blog.csdn.net/javasus/article/details/50015687