代码挑战：幸福数字 - C++
【摘要】 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 ...
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.
方案：
class HappyNumber {
public:
bool isHappy(int n) {
unordered_set<int> set;
while (set.find(n) == set.end())
{
set.insert(n);
int value = 0;
while (n > 0)
{
value += pow(n % 10, 2);
n /= 10;
}
n = value;
}
return n == 1;
}
};
测试案例：
TEST_METHOD(TestMethod1)
{
HappyNumber happyNumber;
Assert::AreEqual(true, happyNumber.isHappy(19));
}
TEST_METHOD(TestMethod2)
{
HappyNumber happyNumber;
Assert::AreEqual(false, happyNumber.isHappy(4));
}
TEST_METHOD(TestMethod3)
{
HappyNumber happyNumber;
Assert::AreEqual(false, happyNumber.isHappy(123));
}
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）