202. Happy Number

最新推荐文章于 2024-01-10 13:13:11 发布

佛系城

最新推荐文章于 2024-01-10 13:13:11 发布

阅读量207

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/fujch3/article/details/75636684

版权

Leetcode 专栏收录该内容

108 篇文章

订阅专栏

本文介绍了一种用于判断一个正整数是否为快乐数的算法。快乐数是指通过反复替换该数为它每个位数的平方和，最终能得到1的数。文章提供了两种实现方式：一种是使用哈希表记录每一步的计算结果来避免重复；另一种是采用龟兔赛跑算法（Floyd判圈算法）来高效检测循环。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目来源【Leetcode】

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

方法一：这个是直接按照是否满足条件进行循环

int digsum(int n){
    int re = 0;
    while(n != 0){
       int t = n % 10;
       re += t*t;
       n = n/10;
    }
    return re;
}

class Solution {
public:
    bool isHappy(int n) {
        map<int,int>m;
        while(1){
            int temp = digsum(n);
            if(temp == 1) return true;
            m[temp]++;
            if(m[temp] > 1) return false;
            n = temp;
        }
    }
};

方法二：是用龟兔赛跑算法（Floyd判圈算法），这个效率更快

int digsum(int n){
    int re = 0;
    int t;
    while(n != 0){
       t = n % 10;
       re += t*t;
       n = n/10;
    }
    return re;
}

class Solution {
public:
    bool isHappy(int n) {
        int slow = n;
        int fast = n;
        do{
           slow = digsum(slow);
           fast = digsum(digsum(fast));
        }while(slow != fast);
        if(slow == 1) return true;
        else return false;

    }
};