【LeetCode 面试经典150题】202. Happy Number 快乐数

202. Happy Number

题目大意

Write an algorithm to determine if a number n 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.
• 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.

Return true if n is a happy number, and false if not.

中文释义

编写一个算法来判断一个数 n 是否为快乐数。

快乐数是按以下过程定义的数字：

• 从任意正整数开始，将数字替换为其各位数字的平方和。
• 重复这个过程，直到数字等于 1（它将保持不变），或者它在不包括 1 的循环中无限循环。
• 结果为 1 的数字是快乐数。

如果 n 是快乐数，则返回 true，否则返回 false。

示例

Exampl