[Leetcode] 202. Happy Number 解题报告

最新推荐文章于 2020-12-20 07:52:06 发布

魔豆Magicbean

最新推荐文章于 2020-12-20 07:52:06 发布

阅读量419

点赞数

分类专栏： IT公司面试习题文章标签：解题报告 Leetcode Hash Table

本文链接：https://blog.csdn.net/magicbean2/article/details/73252488

版权

IT公司面试习题专栏收录该内容

736 篇文章 5 订阅

订阅专栏

题目：

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) {
        unordered_set<int> hash;
    	do {
    		hash.insert(n);
    		int m = 0;
    		while (n > 0) {
    			m += pow(n % 10, 2);
    			n /= 10;
    		}
    		n = m;
    	} while (hash.find(n) == hash.end());
    	return hash.find(1) != hash.end();
    }
};