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

1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

题解

如果一个数，一直用其各位平方和代替它，最后得到1，则是happy数，否则陷入死循环的圈中。

解法1：既然不是happy数会有死循环，那么可以记录之前出现的数，如果发现是1或者是之前出现的数，就可以停止循环。

class Solution {
public:
    bool isHappy(int n) {
        unordered_set<int> haha;
        int sum;
        while(!haha.count(n)){
            haha.insert(n);
            sum = 0;
            while(n){
                sum += (n % 10) * (n % 10);
                n /= 10;
            }
            n = sum;
        }
        return n == 1;
    }
};

解法2：如果我们把循环看作一个链表，那么实际上就等价于判断是否有环的问题，如果是happy数，环就是1。
使用快慢指针判断是否有环，空间复杂度O(1)，且时间复杂度也会更优，假设走了n步，环节点之前的长度是m，环长度为l，有2*n - n = n = k*l（k为任一正整数），则最小的k满足条件（k-1)* l < m < k*l，故在slow第一次走完环之前必然相遇，而解法1要走完第一次环到环节点（此时才有重复值）才能判断出来。

class Solution {
public:
    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 = n, fast = n;
        do {
            slow = digitSquareSum(slow);
            fast = digitSquareSum(fast);
            fast = digitSquareSum(fast);
        } while(slow != fast);
        return slow == 1;
    }
};