leetcode 202. Happy Number

最新推荐文章于 2022-12-25 17:59:02 发布

qq_28388867

最新推荐文章于 2022-12-25 17:59:02 发布

阅读量101

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/qq_28388867/article/details/85166489

版权

刷题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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

用哈希表判断是否进入了循环，时间复杂度为O（n）

class Solution {
public:
    bool isHappy(int n) {
        unordered_map<int,int> tmp;
        int t;
             

        while(n!=1){
                        
            if(tmp[n]) return false;
            else tmp[n]++;
            
            t=0;
            t+=pow(n%10,2);
            while(n=n/10){
                            t+=pow(n%10,2);
            }
            n=t;

            
        }
        return true;

    }
};