LeetCode-4.2-美区-202-E-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:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

思路

（1）刚开始想的是动态规划，当结果是1,10,100,1000…的情况下都可以，然后1+9=10，36+64=100，这样就想到利用记忆表来自底向上的动态规划。类似题：LeetCode-BFS&DP-279-M：完全平方数（Perfect Squares）
（2）关键是没有读懂repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1，重复这个过程直到这个数变为 1，也可能是无限循环但始终变不到 1。说明结果只有两种，要么出现1，要么无限循环，不会有无限不循环的情况。
（3）解法1利用哈希表来记录处理，遇到重复数字就返回false，否则必定可以遇到1，跳出循环。new HashSet<>()
（4）解法2快慢指针。

解法1-哈希

class Solution {
    public boolean isHappy(int n) {
        if(n == 1){
            return true;
        }
  
        HashSet<Integer> set = new HashSet<>();
        while(n != 1){
            int tmp = 0;
            while(n > 9){
                int a = n%10;
                tmp += a*a;
                n /=10;
            }
            tmp += n*n;
            n = tmp;
            if(set.contains(n)){
                return false;
            }else{
                set.add(n);
            }
        }
        return true;
    }
}

解法2-快慢指针

class Solution {
    public boolean isHappy(int n) {
        int fast=n;
        int slow=n;
        do{
            slow=squareSum(slow);
            fast=squareSum(fast);
            fast=squareSum(fast);
        }while(slow!=fast);
        if(fast==1)
            return true;
        else return false;
    }
    
    private int squareSum(int m){
        int squaresum=0;
        while(m!=0){
           squaresum+=(m%10)*(m%10);
            m/=10;
        }
        return squaresum;
    }
}