202. Happy Number

最新推荐文章于 2021-02-16 11:39:33 发布

好多鱼哦

最新推荐文章于 2021-02-16 11:39:33 发布

阅读量268

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/shuke1991/article/details/51784411

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

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

12 + 92 = 82
82 + 22 = 68
62 + 82 = 100

12 + 02 + 02 = 1
利用求余计算各位平方和的值，利用map记录是否重复。这个要好好自己实现一下。

class Solution {
public:
    bool isHappy(int n) {
        if (n == 1) return true;
        if (n == 0) return false;
        int m ; 
        map<int,bool> Happymap;
        while (n != 1) { 
            if (Happymap[n] == true) break;
            Happymap[n] = true; 
            m = 0; 
            while (n) {
                m += (n%10) * (n%10); 
                n = n/10;
            }
            n = m; 
            if (n == 1) return true;
        }
        return false;
    }
};