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.
  
• 地址

问题分析

• 这个题和判断链表有否有环很像。
• 如果要是 Happy Number 的话，那么一直计算下去一定会为1**。如果不是的话，那么中途计算的数字一定会组成一个环，发生重复**。
  所以对于判重，又有两种做法：
  
  • 用额外空间：
    用set记录中间过程平方和，每当计算出当前平方和去看set中是否已经存在该数字，若发生重复，则不是幸运数字。
  • 不用额外空间：
    用判断链表是否有环的快慢指针做法。快2慢1，若最终快慢相同，说明有环。若中途快加出了1，则说明是幸运数字。

代码实现

• set法

    public boolean isHappy(int n) {
        if (n <= 0) {
            return false;
        }
        if (n == 1) {
            return true;
        }
        HashSet<Integer> set = new HashSet<>();
        set.add(n);
        while (n != 1) {
             n = digitSquareSum(n);
            if (set.contains(n)) {
                return false;
            }else {
                set.add(n);
            }
        }
        return true;
    }

    public int digitSquareSum(int n) {
        int happyNum = 0;
        while (n > 0) {
            happyNum +=  (n % 10) * (n % 10);
            n = n / 10;
        }
        return happyNum;
    }

• 快慢指针法

    public boolean isHappy(int n) {
        if (n <= 0) {
            return false;
        }
        int slow = n;
        int fast = digitSquareSum(digitSquareSum(n));
        while (slow != fast && fast != 1) {
            slow = digitSquareSum(slow);
            fast = digitSquareSum(digitSquareSum(fast));

        }
        return fast == 1;
    }

    public int digitSquareSum(int n) {
        int happyNum = 0;
        while (n > 0) {
            happyNum +=  (n % 10) * (n % 10);
            n = n / 10;
        }