LeetCode Algorithms #202 <Happy Number>

最新推荐文章于 2021-05-11 17:59:19 发布

NEUWYT

最新推荐文章于 2021-05-11 17:59:19 发布

阅读量276

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/neuwyt/article/details/50677001

版权

LeetCode 专栏收录该内容

37 篇文章 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

思路：
用个容器装上所有出现过的数字，然后每次计算检查下有没有发生重复。不断循环计算到发生重复，或者结果是1。

解：

class Solution {
public:
    bool isHappy(int n) {
        if(n < 1)
            return false;
        else if(n == 1)
            return true;
        
        unordered_set<int> numbers;
        numbers.insert(n);
        while(1)
        {
            int sum = 0;
            while(n)
            {
                sum += (n%10) * (n%10);
                n /= 10;
            }
            if(sum == 1)
                return true;
            else if(numbers.find(sum) != numbers.end())
                return false;
            numbers.insert(sum);
            n = sum;
        }
    }
};