202. Happy Number (E)

Happy Number (E)

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

---

题意

判断一个数字是否为"Happy Number"：将一个数字各位取出并求其平方之和，得到的和作为新的数字继续重复操作，如果最后能够得到数字1则说明原数字为"Happy Number"；如果最后陷入循环但得不到1则说明原数字不是"Happy Number"。

思路

难点在于对非"Happy Number"循环的判断。

最简单的方法是直接用HashSet记录每一个出现过的数字，当某一个数字再次出现且不为1时，说明陷入循环，为非"Happy Number"。

根据之前的刷题经验，这类判断循环的问题可以使用快慢指针来解决：当快指针追上慢指针且快指针不为1时，说明陷入循环，为非"Happy Number"。

找规律。试了一下非"Happy Number"的循环中总包含了一个"4"，提交代码后发现的确是这样，但不会严格的证明。

---

代码实现 - hash

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

        return true;
    }
}

代码实现 - Two Pointers

class Solution {
    public boolean isHappy(int n) {
        int slow = n, fast = n;
        
        while (fast != 1) {
            slow = nextInt(slow);
            fast = nextInt(nextInt(fast));
            if (fast == slow && fast != 1) {
                return false;
            }
        }

        return true;
    }

    private int nextInt(int n) {
        int sum = 0;
        while (n != 0) {
            sum += (n % 10) * (n % 10);
            n /= 10;
        }
        return sum;
    }
}

代码实现 - 找规律

class Solution {
    public boolean isHappy(int n) {
        while (n != 1 && n != 4) {
            int m = 0;
            while (n != 0) {
                m += (n % 10) * (n % 10);
                n /= 10;
            }
            n = m;
        }
        return n == 1;
    }
}