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
class Solution {
public:
bool isHappy(int n) {
int sum = 0;
if(n<0 || n== 0) return false;
if(n == 1) {
return true;
}
int count =10000;
while(n && count){
int gw = n%10;
sum += gw*gw;
n/=10;
if(n == 0 && sum!=1){
n = sum;
sum = 0;
}else{
if(n == 0 && sum ==1){
return true;
}
}
--count;
}
return false;
}
};
2. 为解决无限死循环,设置一个哈希表容器unordered_set!不使用set而使用无序容器undered_set,因为set是红黑树(一种自由平衡二叉树)实现!为什么不使用multiset/或者unordered_multiset,因为后面两个允许元素重复,而我们要检查sum是否重复,若重复,则会死循环,则可设置return false。那无序容器中,怎么不使用unordered_(multi)map,偏偏使用无序的set容器啊?因为map是二叉树实现,而且是关联容器,额,这次没sb
class Solution {
public:
bool isHappy(int n) {
unordered_set<int> hashSet;
int sum = 0;
if(n<0 || n== 0) return false;
if(n == 1) {
return true;
}
while(n){
int gw = n%10;
sum += gw*gw;
n/=10;
if(n == 0 && sum!=1){
n = sum;
if(hashSet.find(sum) == hashSet.end()){
hashSet.insert(sum);
}else{
return false;
}
sum = 0;
}else{
if(n == 0 && sum ==1){
return true;
}
}
}
}
};