leetcode-202 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: 19 is a happy number

1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

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

• 本文已收录于以下专栏：

Happy Number - LeetCode 202

• bu_min
• 2015年05月20日 20:32
• 219

<LeetCode OJ> 202. Happy Number

202. Happy Number My Submissions Question Total Accepted: 46878 Total Submissions: 134944 Diffic...

LeetCode 202 Happy Number（开心数）（vector、unordered_set）

• NoMasp
• 2016年01月19日 10:51
• 1783

Leetcode 202：Happy Number

Write an algorithm to determine if a number is "happy". A happy number is a number defined by the fo...

Leetcode 202. Happy Number

Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the fol...

leetCode 202. Happy Number

举报原因： 您举报文章：leetcode-202 Happy Number 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)