通过测试发现,不满足“快乐数”条件的数在进行各位求和的过程中,必定会进入一条死循环序列,序列如下:
4 16 37 58 89 145 42 20
也就是说,循环过程中一旦出现上述序列的某一值,将会陷入死循环,同理,可据此进行判断,作为跳出循环的依据,实现代码如下:
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
class Solution
{
public:
bool isHappy(int n)
{
vector<int> store;
int storetimes=20;
while (1)
{
int sum = 0;
while (n != 0)
{
sum += (n % 10) * (n % 10);
n /= 10;
}
if (sum == 1)
return true;
n = sum;
store.push_back(sum);
storetimes--;
if(storetimes==0)
{
if(find(store.begin(),store.end(),4)!=store.end())
return false;
}
}
}
};
int main()
{
Solution a;
cout<<a.isHappy(19);
return 0;
}