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
由于不知道如何判断一个数不是happy数,即如何退出循环呢?(如果是happy数就简单了),
学习和参考了别人家的解法:
class Solution {
public:
int getSquare(int num){ //because square operation is very often, so enum the result
switch(num){
case 0: return 0;
case 1: return 1;
case 2: return 4;
case 3: return 9;
case 4: return 16;
case 5: return 25;
case 6: return 36;
case 7: return 49;
case 8: return 64;
case 9: return 81;
}
}
bool isHappy(int n) {
if(n == 0) return false;
set<int> squareSum;
return dfs(n, squareSum);
}
bool dfs(int n, set<int>& squareSum){
int tmp;
int sum = 0;
while(n){
tmp = n%10;
sum += getSquare(tmp);
n /= 10;
}
if(sum == 1)
return true;
else if(squareSum.find(sum)!=squareSum.end()) //sum这个值出现过,说明循环了?
return false;
else {
squareSum.insert(sum);
return dfs(sum, squareSum);
}
}
};
既然如此,改写别人家的算法:
class Solution {
public:
bool isHappy(int n)
{
if(n == 0)
return false;
set<int> squareSum;
squareSum.insert(n);
while(n != 1)
{
int sum = 0;
while(n)
{
int digit = n % 10;
sum += digit * digit;
n /= 10;
}
n = sum;
if(squareSum.count(n)) //n这个值是否出现过,set不允许相同值存在,count要么0要么1
return false;
else
squareSum.insert(n);
}
return true;
}
};
注:本博文为EbowTang原创,后续可能继续更新本文。如果转载,请务必复制本条信息!
原文地址:http://blog.csdn.net/ebowtang/article/details/50417558
原作者博客:http://blog.csdn.net/ebowtang
参考资源:
【1】 博文地址,http://www.cnblogs.com/qionglouyuyu/p/5052927.html